Consistency

Prime #

737

Origin domain

Mathematics

Subdomain

logic → Mathematics

Core Idea

A system is consistent when the commitments it carries cannot jointly derive a contradiction. It is a property not of any single statement but of a set of commitments under a combination rule, and it is the minimal coherence condition any commitment-bearing system must satisfy — since under explosion an inconsistent set derives everything and so constrains nothing.

How would you explain it like I'm…

Rules That Don't Fight

Consistency means your rules don't fight with each other. If one rule says "the door is open" and another says "the door is not open," something is broken, because both can't be true. A set of rules is consistent when none of them contradict each other like that.

No Contradictions Allowed

Consistency is when a set of claims or rules can't be used to prove both something and its opposite at the same time. It's not about one statement by itself — it's about whether a whole bunch of them fit together without clashing. This matters a lot, because in many systems, once you can prove a contradiction, you can "prove" absolutely anything, which makes the rules useless. So being consistent is the bare-minimum thing a set of rules needs before it can be trusted to do any real work. Importantly, consistent doesn't mean true — your rules could fit together perfectly and still describe a made-up story.

Jointly Possible, Not True

A system is consistent when the rules, claims, or commitments it carries cannot jointly derive a contradiction — there's no pair of the form "p and not-p" reachable by its own rules of combination. It's a property not of any single statement but of a set of commitments together with a rule for combining them. Inconsistency isn't just ugly: in any system where a contradiction entails everything, an inconsistent set derives all statements indiscriminately and so constrains nothing — it loses the very function a system of commitments is meant to perform. This is why consistency is the minimal coherence condition any commitment-bearing system must satisfy before its content can do work. And it is distinct from truth: a set can be perfectly consistent about a fiction, while a true claim can sit inside an inconsistent set. Consistency asks only whether the commitments are jointly possible, not whether they are jointly correct.

 

A system is consistent when the rules, claims, or commitments it carries cannot jointly derive a contradiction — when there is no pair of statements of the form "p and not-p" reachable from it by its own rules of combination. The structural commitment is exactly that joint non-derivability of contradiction, and it is a property not of any single statement but of a set of commitments together with a rule for combining them. Inconsistency is not merely an aesthetic blemish: in any system whose combination rule supports the principle that a contradiction entails everything, an inconsistent set derives all statements indiscriminately and therefore constrains nothing — it has lost the very function a system of commitments is meant to perform. This is why consistency is the minimal coherence condition that any commitment-bearing system must satisfy before its content can do any work at all. The property is defined without reference to what the statements are about, which is what lets it travel: what is required is a set of commitments taken as binding within some scope, a combination rule for jointly evaluating them (logical inference, query evaluation, judicial interpretation, narrative reading), and a joint-satisfiability test asking whether any assignment, world, or interpretation makes all of them hold at once. When the answer is no, the defect localizes to a minimal conflicting subset — the smallest collection of commitments whose joint unsatisfiability already produces the contradiction. Crucially, consistency is distinct from truth: a set can be perfectly consistent about a fiction, and a true claim can sit in an inconsistent set. Consistency asks only whether the commitments are jointly possible, not whether they are jointly correct, and keeping those two questions separate is part of what the prime contributes.

Broad Use

• Mathematics and logic: an axiom set is consistent if no derivation yields both a formula and its negation.
• Databases and distributed systems: schema constraints — uniqueness, referential integrity, business rules — must not jointly forbid any state the system must record.
• Law and policy: statutes and clauses can be jointly inconsistent (rule A requires X while rule B forbids it), resolved by ordering, exception, or amendment.
• Narrative and testimony: an account, novel, or film is internally consistent when its facts and timeline are jointly satisfiable.
• Personal commitments and identity: stated beliefs, promises, and actions form a set that is or is not jointly satisfiable; dissonance is the felt cost.

Clarity

It turns "something doesn't add up" into a sharp question — is there any joint assignment satisfying all commitments? — and separates joint possibility from truth: a set can be flawlessly consistent about a fiction.

Manages Complexity

It localizes a defect: an inconsistency lives in a minimal conflicting subset, typically tiny relative to the whole, so one shrinks to the conflicting core and repairs there rather than inspecting the whole system.

Abstract Reasoning

It supports portable moves — unsatisfiable-core localization, conflict resolution by minimal edit, soundness/consistency separation, and reading trivialization (a system that suddenly "proves anything") as the signature of a latent contradiction.

Knowledge Transfer

• Logic → law/software: locate the minimal conflicting subset before patching, since fixing one rule in isolation may relocate the conflict.
• Formal systems → policy: add a priority or scope qualifier rather than a wholesale rewrite to dissolve most inconsistencies.
• General: detect drift early via assertion-style invariants checked at the point of entry — type checkers, database constraints, courtroom objections.

Example

A vacation policy that requires unlimited rollover, caps balances at a fixed maximum, and credits more days than light users consume is jointly unsatisfiable for those users — and HR's fix is to find the minimal conflicting subset and add a capped-rollover-with-payout qualifier, the same operation a compiler performs on conflicting type constraints.

Relationships to Other Primes

Parents (1) — more general patterns this builds on

• Consistency presupposes Constraint — The file: 'Consistency is a META-property of a COLLECTION of constraints' — whether the intersection of all their admissible regions is nonempty. A lone constraint is never inconsistent; consistency presupposes a set of constraints. The 0.87 embedding-nearest is constraint.

Path to root: Consistency → Constraint

Not to Be Confused With

• Consistency is not Constraint because a constraint is a single restriction whereas consistency is a meta-property of a whole set — whether they can be jointly satisfied.
• Consistency is not Compatibility because compatibility is pairwise whereas consistency is global joint-satisfiability, so every pair can be compatible yet a three-way interaction still conflicts.
• Consistency is not Completeness because completeness asks whether a system decides every question whereas consistency asks whether it avoids deciding some question both ways — and for expressive systems the two pull apart.