{
  "id": "contradiction-logic",
  "title": "Contradiction (Logic)",
  "lang": "en",
  "source_lang": "en",
  "summary": "A contradiction is a formula that is false under every classical interpretation, or, more narrowly, a statement conjoined with its own negation.",
  "category": "mathematics",
  "subcategory": "discrete-logic",
  "type": "concept",
  "aliases": [
    "Contradictory formula",
    "logical contradiction",
    "antilogy"
  ],
  "generated_at": "2026-11-03",
  "model": "pro/gpt-6.1-sol",
  "url": "https://aiwiki.page/en/contradiction-logic/",
  "translations": {
    "zh-Hans": {
      "url": "https://aiwiki.page/zh/contradiction-logic/",
      "json": "https://aiwiki.page/zh/contradiction-logic.json"
    }
  },
  "sections": [
    {
      "heading": "",
      "text": "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 \\(P\\land\\neg P\\), meaning “\\(P\\) and not \\(P\\).” 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."
    },
    {
      "heading": "Definition and basic examples",
      "text": "In classical propositional logic, a formula \\(A\\) is a contradiction if every assignment \\(v\\) of truth values to its propositional variables makes it false:\n\n\\[v(A)=\\mathrm{F}\\qquad\\text{for every valuation }v.\\]\n\nFor example, \\(P\\land\\neg P\\) is false whether \\(P\\) is true or false. Its truth table is:\n\n\\(P\\) | \\(\\neg P\\) | \\(P\\land\\neg P\\)\nTrue | False | False\nFalse | True | False\n\nA contradictory formula need not visibly contain a statement immediately conjoined with its negation. For instance,\n\n\\[(P\\to Q)\\land P\\land\\neg Q\\]\n\nis also a contradiction. If \\(P\\to Q\\) and \\(P\\) are both true, then \\(Q\\) must be true, which conflicts with the final conjunct.\n\nA 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 \\(P\\), which can receive either truth value. Logical contradiction concerns impossibility under the relevant interpretations, not merely disagreement with actual facts.\n\nIn first-order logic, the corresponding semantic definition is that no structure, together with an assignment to any free variables, satisfies the formula. Thus\n\n\\[\\exists x\\bigl(R(x)\\land\\neg R(x)\\bigr)\\]\n\nis contradictory in classical first-order semantics."
    },
    {
      "heading": "Contradiction, tautology, and satisfiability",
      "text": "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:\n\n- A tautology is always true.\n- A contradiction is always false.\n- A contingent formula can be either true or false.\n\nIn classical propositional logic, a formula \\(A\\) is a contradiction exactly when \\(\\neg A\\) is a tautology. Equivalently,\n\n\\[\\models\\neg A.\\]\n\nHere \\(\\models\\) expresses semantic validity. A contradiction is also called unsatisfiable, because there is no valuation that makes it true.\n\nThese relationships are useful in testing arguments. An inference from premises \\(A_1,\\ldots,A_n\\) to conclusion \\(B\\) is classically valid exactly when\n\n\\[A_1\\land\\cdots\\land A_n\\land\\neg B\\]\n\nis unsatisfiable. A counterexample to the inference would make every premise true and the conclusion false; unsatisfiability establishes that no such counterexample exists.\n\nIn Boolean algebra, every contradictory formula represents the bottom element \\(0\\). In particular,\n\n\\[a\\land\\neg a=0.\\]"
    },
    {
      "heading": "Falsum and formal derivation",
      "text": "Formal languages often contain a constant \\(\\bot\\), pronounced falsum or bottom, representing falsity. Under classical semantics, \\(\\bot\\) is false in every interpretation, and every contradictory formula is logically equivalent to it.\n\nA distinction is necessary between semantic and syntactic claims:\n\n- \\(\\Gamma\\models A\\) means that every interpretation satisfying all formulas in \\(\\Gamma\\) also satisfies \\(A\\).\n- \\(\\Gamma\\vdash A\\) means that \\(A\\) is derivable from \\(\\Gamma\\) using the rules of a specified formal system.\n\nIn natural deduction, a typical rule permits the derivation of \\(\\bot\\) from \\(A\\) and \\(\\neg A\\):\n\n\\[\\frac{A\\qquad\\neg A}{\\bot}.\\]\n\nDepending on the presentation, negation may be a primitive connective or may be defined by\n\n\\[\\neg A := A\\to\\bot.\\]\n\nWith this definition, deriving falsum from \\(A\\) and \\(\\neg A\\) is an application of implication elimination.\n\nSemantic 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."
    },
    {
      "heading": "Contradictions and inconsistent theories",
      "text": "A contradiction is a formula or a combination of assertions; consistency is a property of a set of formulas or a theory.\n\nA theory \\(T\\) is syntactically inconsistent in the usual classical sense if, for some formula \\(A\\),\n\n\\[T\\vdash A \\qquad\\text{and}\\qquad T\\vdash\\neg A.\\]\n\nIn standard classical systems, this is equivalent to \\(T\\vdash\\bot\\). A theory is semantically unsatisfiable if it has no model.\n\nA set of premises can be inconsistent even when none of its members is individually contradictory. For example,\n\n\\[\\{P,\\;P\\to Q,\\;\\neg Q\\}\\]\n\nhas no classical model, although each of its three formulas is individually satisfiable. The conflict lies in their combination.\n\nLikewise, 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."
    },
    {
      "heading": "The principle of explosion",
      "text": "Classical logic validates the principle of explosion, traditionally expressed as ex contradictione quodlibet: from a contradiction, anything follows.\n\nIts familiar form is\n\n\\[P,\\neg P\\vdash Q,\\]\n\nwhere \\(Q\\) is arbitrary. One classical derivation proceeds by inferring \\(P\\lor Q\\) from \\(P\\), then using \\(\\neg P\\) to eliminate the first alternative and obtain \\(Q\\).\n\nSemantically, no classical interpretation makes both \\(P\\) and \\(\\neg P\\) true. Consequently, there is no interpretation in which both premises are true and \\(Q\\) is false. The inference therefore satisfies the semantic definition of validity.\n\nExplosion 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."
    },
    {
      "heading": "Role in indirect proof",
      "text": "Contradictions support several forms of indirect reasoning in mathematical proof.\n\nNegation introduction\n\nIf assuming \\(A\\) leads to falsum, the assumption can be discharged and \\(\\neg A\\) concluded:\n\n\\[\\frac{\\Gamma,A\\vdash\\bot}{\\Gamma\\vdash\\neg A}.\\]\n\nThis rule is accepted in both classical and intuitionistic logic. It establishes that the assumed proposition cannot hold.\n\nClassical proof by contradiction\n\nIn the standard classical form of proof by contradiction, assuming \\(\\neg A\\) and deriving falsum permits the conclusion \\(A\\):\n\n\\[\\frac{\\Gamma,\\neg A\\vdash\\bot}{\\Gamma\\vdash A}.\\]\n\nIntuitionistically, this reasoning directly establishes only \\(\\neg\\neg A\\). Passing from that result to \\(A\\) requires double-negation elimination, which is not generally valid in intuitionistic logic.\n\nThus 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."
    },
    {
      "heading": "Non-contradiction and alternative logics",
      "text": "The law of non-contradiction is commonly formalized as\n\n\\[\\neg(P\\land\\neg P).\\]\n\nIt is distinct from the law of excluded middle, \\(P\\lor\\neg P\\), and from explosion. Although all three hold classically, alternative logics separate their roles.\n\nIntuitionistic logic proves non-contradiction and accepts explosion, while not accepting excluded middle in general. Minimal logic retains intuitionistic reasoning without the general rule that \\(\\bot\\) entails an arbitrary formula.\n\nParaconsistent 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.\n\nSome 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."
    },
    {
      "heading": "Historical background and applications",
      "text": "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.\n\nContradiction 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.\n\nIn 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.\n\nIn 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.\n\nContradictions 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."
    }
  ],
  "links": [
    "logic",
    "propositional-logic",
    "truth-table",
    "first-order-logic",
    "tautology",
    "boolean-algebra",
    "formal-system",
    "natural-deduction",
    "godels-completeness-theorem",
    "axiom",
    "model-theory",
    "mathematical-proof",
    "intuitionistic-logic",
    "proof-by-contradiction",
    "double-negation-elimination",
    "law-of-excluded-middle",
    "paraconsistent-logic",
    "aristotle",
    "boolean-satisfiability-problem",
    "formal-verification"
  ],
  "sources": [],
  "license": "https://creativecommons.org/licenses/by/4.0/"
}