Contradiction (logic and reasoning)

Formal properties and symbols

In many proof systems a special symbol denotes contradiction, commonly the bottom symbol ⊥ or sometimes 0. From a syntactic point of view, a contradiction can be an explicit formula (for example, A & ¬A) or a derived symbol produced when a proof reaches an inconsistency. Semantically, a formula is a contradiction when it is false in every model; a set of formulas is inconsistent if it entails at least one contradiction. In classical logic the principle of explosion (ex falso quodlibet) states that once a contradiction is accepted, any formula can be derived from it, which is why inconsistency is treated as highly problematic for deductive systems.

History and illustrative stories

The idea that two mutually exclusive claims cannot both be true goes back to ancient philosophy. Aristotle formulated the law of non-contradiction, often expressed roughly as "contradictory statements cannot both be true at the same time and in the same respect." A widely cited cultural anecdote comes from China: a merchant advertised spears that could pierce any shield and shields that could block any spear. The two claims together are inconsistent and gave rise to the Chinese word for contradiction, máodùn (矛盾), literally "spear and shield." These historical touches show that the intuitive sense of contradiction predates formal symbolic logic.

Examples and applications

Common examples include simple pairs like "A is B" and "A is not B" about the same A and B, mathematical inconsistencies such as a system that both proves and disproves a theorem, and paradoxes like the liar sentence that complicate how truth and contradiction interact. In mathematics and formal sciences, contradictions are often exposed through proof by contradiction (reductio ad absurdum): to show statement S holds, one assumes ¬S and derives a contradiction, thereby justifying S. Detecting contradictions is also a practical task in software verification, database consistency checks, and automated theorem proving.

Philosophical and logical distinctions

Notions related to contradiction include inconsistency (a set entails a contradiction), contrariety (two propositions that cannot both be true but may both be false), and contradiction proper (which are exact negations of one another). Different logical systems treat contradiction differently: classical logics accept explosion, while paraconsistent logics intentionally reject explosion so that a theory can tolerate some contradictions without triviality. Distinguishing syntactic contradiction (provable falsehood) from semantic contradiction (unsatisfiable formula) is important in formal proof theory and model theory.

Notable facts and further reading

• Basic definitions and examples
• Contradiction in formal logic
• Chinese origin: the spear and shield story
• Aristotle and the law of non-contradiction
• Proof by contradiction (reductio ad absurdum)
• Paradoxes related to contradiction
• Paraconsistent approaches
• Applications in computer science and mathematics

Contradiction is a small word for a concept with broad consequences: it organizes how we think about truth, guides formal proof techniques, and motivates alternative logics when classical consequences are unacceptable. Whether in everyday disputes or formal theories, recognizing and resolving contradictions remains a central task of rational inquiry.