A contradiction in logic is, in the semantic sense standard in classical logic, a formula that is false under every interpretation. The simplest example is , meaning “ and not .” More narrowly, the term denotes any formula of this explicit form, or the joint assertion of a statement and its negation. Contradictions are central to the study of consistency, logical consequence, and indirect proof. Their treatment depends on the logical system: classical and intuitionistic logic allow any conclusion to follow from a contradiction, whereas paraconsistent logics reject this unrestricted inference.
Definition and basic examples
In classical propositional logic, a formula is a contradiction if every assignment of truth values to its propositional variables makes it false:
For example, is false whether is true or false. Its truth table is:
| True | False | False |
| False | True | False |
A contradictory formula need not visibly contain a statement immediately conjoined with its negation. For instance,
is also a contradiction. If and are both true, then must be true, which conflicts with the final conjunct.
A contradiction differs from a statement that merely happens to be false. The proposition “Paris is in Germany” is false under its ordinary interpretation, but its propositional form is simply , which can receive either truth value. Logical contradiction concerns impossibility under the relevant interpretations, not merely disagreement with actual facts.
In first-order logic, the corresponding semantic definition is that no structure, together with an assignment to any free variables, satisfies the formula. Thus
is contradictory in classical first-order semantics.
Contradiction, tautology, and satisfiability
A tautology is a propositional formula true under every valuation. A contingent formula is true under some valuations and false under others. These categories yield a three-way classification:
- A tautology is always true.
- A contradiction is always false.
- A contingent formula can be either true or false.
In classical propositional logic, a formula is a contradiction exactly when is a tautology. Equivalently,
Here expresses semantic validity. A contradiction is also called unsatisfiable, because there is no valuation that makes it true.
These relationships are useful in testing arguments. An inference from premises to conclusion is classically valid exactly when
is unsatisfiable. A counterexample to the inference would make every premise true and the conclusion false; unsatisfiability establishes that no such counterexample exists.
In Boolean algebra, every contradictory formula represents the bottom element . In particular,
Falsum and formal derivation
Formal languages often contain a constant , pronounced falsum or bottom, representing falsity. Under classical semantics, is false in every interpretation, and every contradictory formula is logically equivalent to it.
A distinction is necessary between semantic and syntactic claims:
- means that every interpretation satisfying all formulas in also satisfies .
- means that is derivable from using the rules of a specified formal system.
In natural deduction, a typical rule permits the derivation of from and :
Depending on the presentation, negation may be a primitive connective or may be defined by
With this definition, deriving falsum from and is an application of implication elimination.
Semantic unsatisfiability and syntactic derivability of falsum coincide in sound and complete classical proof systems. Gödel’s completeness theorem establishes the relevant connection for classical first-order logic.
Contradictions and inconsistent theories
A contradiction is a formula or a combination of assertions; consistency is a property of a set of formulas or a theory.
A theory is syntactically inconsistent in the usual classical sense if, for some formula ,
In standard classical systems, this is equivalent to . A theory is semantically unsatisfiable if it has no model.
A set of premises can be inconsistent even when none of its members is individually contradictory. For example,
has no classical model, although each of its three formulas is individually satisfiable. The conflict lies in their combination.
Likewise, a statement may conflict with a particular theory without being a logical contradiction by itself. A claim incompatible with the axioms of a particular mathematical structure is false relative to that theory; it need not be false in every possible structure. This distinction is important in model theory and in separating logical truths from theory-dependent results.
The principle of explosion
Classical logic validates the principle of explosion, traditionally expressed as ex contradictione quodlibet: from a contradiction, anything follows.
Its familiar form is
where is arbitrary. One classical derivation proceeds by inferring from , then using to eliminate the first alternative and obtain .
Semantically, no classical interpretation makes both and true. Consequently, there is no interpretation in which both premises are true and is false. The inference therefore satisfies the semantic definition of validity.
Explosion does not mean that every statement is true in the ordinary interpretation whenever an error is made. It means that an inconsistent set of premises, under an explosive consequence relation, entails every formula. This makes consistency essential to the discriminating use of classical theories.
Role in indirect proof
Contradictions support several forms of indirect reasoning in mathematical proof.
Negation introduction
If assuming leads to falsum, the assumption can be discharged and concluded:
This rule is accepted in both classical and intuitionistic logic. It establishes that the assumed proposition cannot hold.
Classical proof by contradiction
In the standard classical form of proof by contradiction, assuming and deriving falsum permits the conclusion :
Intuitionistically, this reasoning directly establishes only . Passing from that result to requires double-negation elimination, which is not generally valid in intuitionistic logic.
Thus the ability to derive and use a contradiction does not, by itself, determine whether a proof is classical. The decisive issue is which conclusion the system permits after the temporary assumption is discharged.
Non-contradiction and alternative logics
The law of non-contradiction is commonly formalized as
It is distinct from the law of excluded middle, , and from explosion. Although all three hold classically, alternative logics separate their roles.
Intuitionistic logic proves non-contradiction and accepts explosion, while not accepting excluded middle in general. Minimal logic retains intuitionistic reasoning without the general rule that entails an arbitrary formula.
Paraconsistent logic rejects unrestricted explosion. It allows some inconsistent premise sets to have nontrivial consequences rather than entailing every formula. Consequently, expressions such as “contradiction” and “unsatisfiable formula” cannot always be treated as interchangeable outside classical logic.
Some paraconsistent semantics allow a formula to have both truth and falsity status. This does not make every formula acceptable, nor does paraconsistency itself assert that any actual contradiction is true. The philosophical position that some contradictions are true is called dialetheism, a distinct claim.
Historical background and applications
Aristotle gave a foundational discussion of non-contradiction in Book IV of the Metaphysics, emphasizing that the same attribute cannot both belong and not belong to the same subject in the same respect. Modern symbolic logic recasts such issues through formal languages, truth conditions, and inference rules.
Contradiction testing has practical uses in automated reasoning. A Boolean satisfiability solver can determine whether a propositional formula has a satisfying assignment; an unsatisfiable result identifies a contradiction in the semantic sense.
In formal verification, a system description can be combined with the negation of a proposed property. If that combination is unsatisfiable within the chosen model, no modeled behavior violates the property.
In classical first-order automated theorem proving, resolution-based refutation methods seek a contradiction from premises together with the negated conclusion. Deriving the empty clause establishes unsatisfiability, although first-order validity is undecidable in general, so such searches need not terminate for every input.
Contradictions also guide the diagnosis of inconsistent specifications. An unsatisfiable core is an unsatisfiable subset of the original constraints; identifying such a subset can localize the conflict without implying that each constraint is individually contradictory.