✦ScienexySCIENCE KNOWLEDGE LIBRARY
reference · SCI-MAT-012-016

Logical Consistency and Inconsistency

A set of logical statements is consistent when they can all be true together under at least one interpretation, and inconsistent when no interpretation satisfies them all.

  • Γ is satisfiable if there exists M such that M ⊨ Γ

  • Γ is inconsistent if no M satisfies every formula in Γ

  • {p, ¬p} — an inconsistent set in classical logic

Explanation

Consistency and inconsistency describe whether a collection of statements can be jointly satisfied. In classical propositional logic, a set of formulas is consistent if there is at least one truth assignment that makes every formula true. It is inconsistent if no such assignment exists. For example, the statements p and ¬p are inconsistent because they cannot both be true under the same classical interpretation. A consistent set does not need to be true in every interpretation; it only needs one satisfying interpretation. Consistency is important in mathematical theories, databases, knowledge bases, legal rule systems, and formal specifications. In formal proof systems, syntactic consistency is often defined by the absence of a derivation of contradiction, with its relationship to semantic consistency depending on the system's soundness and completeness.

Variables

  • Γ: a set of logical formulas

  • M: an interpretation or model

  • p: a proposition

  • ¬p: negation of p

  • ⊨: semantic satisfaction

Example or application

The set {p ∨ q, ¬p, q} is consistent because assigning p = F and q = T makes all three formulas true. The set {p, ¬p} is inconsistent.

Definition

Logical consistency is the property of a set of formulas having at least one common model, while inconsistency means that no common model exists.

Purpose

To determine whether a collection of assumptions or rules can coexist without contradiction.

Importance

Consistency is essential when developing mathematical theories, maintaining reliable knowledge bases, designing formal systems, and identifying contradictory requirements.

Learning Objectives

  • Define logical consistency and inconsistency.

  • Test the consistency of simple formula sets.

  • Explain the relationship between consistency and satisfiability.

  • Identify contradictory assumptions.

  • Distinguish semantic consistency from syntactic consistency.

Key Concepts

  • Consistency

  • Inconsistency

  • Satisfiability

  • Contradiction

  • Model

  • Formal theory

  • Premise set

Working Principle

A collection of formulas is examined as a whole. If one interpretation satisfies every formula simultaneously, the collection is consistent. If no such interpretation exists, it is inconsistent.

Process

  • List all formulas in the collection.

  • Identify possible conflicts between the formulas.

  • Construct truth assignments or interpretations.

  • Check whether any interpretation satisfies all formulas.

  • Classify the collection as consistent or inconsistent.

Applications

  • Checking mathematical axiom systems

  • Validating database constraints

  • Detecting contradictory requirements

  • Knowledge-base verification

  • Formal specification

  • Automated reasoning

Worked Example

Consider Γ = {p → q, p, ¬q}. If p is true, the implication p → q requires q to be true. However, Γ also requires ¬q to be true. This is impossible under classical logic. Therefore, Γ is inconsistent.

Common Misconceptions

  • A consistent set does not have to be true under every interpretation.

  • One false formula under a particular interpretation does not prove inconsistency.

  • Inconsistency concerns the entire collection of formulas.

  • Consistency and logical validity are different properties.

Practice Questions

  • What does logical consistency mean?

  • Why is {p, ¬p} inconsistent?

  • Can a consistent set contain a formula that is not logically valid?

  • Determine whether {p → q, p, q} is consistent.

  • Explain the importance of consistency in a mathematical theory.

Key Takeaway

A logically consistent collection of statements has at least one interpretation in which all its members are true; an inconsistent collection has none.

Prerequisites

  • Satisfiability and Unsatisfiability

  • Logical Expressions and Formulas

  • Logical Consequence

Reference

  • A Mathematical Introduction to Logic — Herbert B. Enderton

  • Mathematical Logic — Joseph R. Shoenfield

Related Topics

  • Satisfiability and Unsatisfiability

  • Logical Equivalence

  • Logical Consequence

  • Soundness and Completeness: Basic Ideas

Sources and verification

Sources are shown as provided in the project data. Not every source has yet been independently verified. Please report errors or missing citations.

  • Source verification pending; check an authoritative textbook, university, standards body, or peer-reviewed source.

Suggest a correction or source · More in Mathematical Logic & Set Theory