Contradiction¶

Version: v3 · 2026-09-28 · History
Prime #: 1342
Domain group: Formal Sciences
Origin domain: Mathematics
Subdomain: Logic → Mathematics
Also from: Computer Science & Software Engineering, Philosophy, Law & Governance, Organizational & Management Science
Aliases: Logical Contradiction
Related primes: Consistency, Proof By Contradiction, Paradox, kettle logic

Core Idea¶

A contradiction occurs when a collection of commitments jointly entails both a proposition and its negation. The abstraction is relational rather than topical: the commitments may be equations, rules, observations, specifications, testimony, or policy clauses, but together they leave no admissible interpretation or state in which all can hold.

How would you explain it like I'm…

Can't Both Be True

Your friend says, "The cookie is in the jar," and also says, "The cookie is not in the jar." Both can't be true at the same time. When things you believe clash like that, you have to change at least one of them.

Can't All Be True

A contradiction happens when a group of statements, taken together, says something is true and also says it is not true. Each statement might seem fine by itself. For example, "Sam is at school," "Sam is at home," and "You can't be in two places at once" can each sound OK, but together they can't all be right. When you find a contradiction, at least one of the statements, or one of the hidden assumptions, has to be fixed.

Joint Unsatisfiability

A contradiction occurs when a set of commitments together implies both a statement and its opposite. The commitments could be rules, facts, equations, a schedule, or witness stories, and each one may be sensible alone; the problem only appears when they are combined. Another way to see it: there is no possible situation in which all of them are true at once. You can often expose the problem by finding the smallest group of statements that clash. Resolving it means revising something, whether a statement, the scope where a rule applies, which rule takes priority, or a background assumption.

A contradiction arises when a collection of commitments jointly entails both a proposition and its negation. Classically, a set Γ is contradictory if Γ ⊢ P and Γ ⊢ ¬P for some P. Model-theoretically, this is the same as there being no interpretation in which every commitment in Γ is true: the set of admissible states is empty. The concept is relational, since each member of the set may be individually consistent while the conjunction is unsatisfiable. It applies to axioms, equations, observations, specifications, testimony, legal rules, schedules, and policy clauses alike. What carries across domains is the joint-satisfiability failure, the possibility of exposing it through a directly conflicting pair or a minimal unsatisfiable core, and the resulting burden to revise at least one commitment, scope assignment, priority rule, or background assumption.

Broad Use¶

Logic and mathematics: a theory that derives both \(P\) and \(\neg P\) has no classical model, and a proof by contradiction uses that failure to discharge an assumption.
Software and databases: requirements or constraints can make the admissible-state set empty even when each rule is individually satisfiable.
Science and diagnosis: a model plus accepted observations can generate mutually incompatible predictions, localizing a premise, measurement, or model component that must be revised.
Law and policy: two rules or commitments can demand incompatible outcomes for the same covered case.
Organizations: plans can jointly require a resource to be both unavailable and fully allocated at the same time.

Clarity¶

Contradiction is stronger than disagreement and narrower than every kind of conflict. The decisive test is joint satisfiability: can the commitments all be true or fulfilled under one interpretation? If not, the contradiction can be exposed by deriving an explicit \(P\) and \(\neg P\), or an equivalent impossibility.

Manages Complexity¶

Contradiction converts diffuse unease about a collection of claims into a small unsatisfiable core. Instead of rejecting the whole system, an analyst can identify the minimum commitments that cannot coexist and decide which premise, scope, priority rule, or observation must change.

Abstract Reasoning¶

The abstraction licenses reductio: add a candidate commitment, derive a contradiction, and infer that the candidate cannot coexist with the retained premises. It also licenses consistency checking, model search, and counterexample construction by asking whether any state satisfies the entire set.

Knowledge Transfer¶

The same empty-model structure appears when axioms yield \(P\) and \(\neg P\), when requirements admit no implementation, when database constraints admit no record, and when two policies impose incompatible duties. The local vocabulary changes, but the satisfiability test and revision burden do not.

Example¶

A release policy requires every security patch to ship within twenty-four hours, while a separate rule prohibits any release before a mandatory forty-eight-hour review. For a security patch covered by both rules, the policy set requires release before and after incompatible deadlines. The contradiction belongs to the joint rule set, not to either rule in isolation.

Relationships to Other Abstractions¶

Current abstraction Contradiction Prime

Foundational — no parent edges in the catalog.

Children (7) — abstractions linked here by typed relations

Immanent critique Domain-specific is a kind of Contradiction

What makes it its own entry: the domain-specific identity determined by the evaluative standard is genuinely internal to the criticized practice and the demonstrated failure concerns its own realization rather than mere external disagreement.
Paraconsistent logic Domain-specific is a kind of Contradiction

It remains its own entry because its identity is fixed by the formal language, consequence relation, negation and contradiction, failed explosion schema, proof rules or semantics, designated values or relevance conditions, examples of controlled inference and comparison with classical logic.
Performative Contradiction Domain-specific is a kind of Contradiction

A genuine performative contradiction is a contradiction between same-act necessary commitments and its content.
Reaction formation Domain-specific is a kind of Contradiction

What makes it its own entry: the domain-specific identity determined by a psychodynamic account identifies the disallowed impulse, anxiety or conflict, exaggerated opposite stance, defensive function, evidence, and viable alternative explanations.
Kettle logic Domain-specific includes Contradiction

Kettle Logic contains a contradiction because at least two defenses are jointly asserted even though their truth conditions cannot coexist.

▸ Show 2 more

Distinction from Neighbors¶

Consistency is the meta-property that a commitment set does not derive a contradiction. Contradiction is the explicit or derivable incompatibility that witnesses a failure of consistency.

Paradox begins with apparently acceptable premises and reasoning that yield a surprising or unacceptable conclusion and demand diagnosis. Some paradoxes expose contradictions, but surprise or conceptual tension alone is not a contradiction.

Conflict can involve competing goals, preferences, or forces that remain jointly describable. Contradiction requires logical or constraint-level joint impossibility.

Mutual Exclusion is a coordination protocol that permits at most one occupant of a state or resource. Contradictory commitments can concern anything and need not describe a protocol.