Consistency¶

Version: v1 · 2026-08-24 · History
Prime #: 737
Origin domain: Mathematics
Subdomain: logic → Mathematics

Core Idea¶

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^[1] — 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 system has a defect, and 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.

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.

Structural Signature¶

the set of commitments held as binding — the combination rule for evaluating them jointly — the joint-satisfiability test — the no-contradiction invariant — the minimal conflicting subset (locus of any defect) — the consistency-versus-truth separation

A system exhibits the consistency property when each of the following holds:

A set of commitments. Some collection of claims, rules, or constraints is taken as binding within a scope; consistency is a property of the set together, never of a single member.
A combination rule. There is a way of jointly evaluating the commitments — logical inference, query evaluation, judicial interpretation, narrative reading — that determines what follows from holding them together.
A joint-satisfiability test. One can ask whether any assignment, world, or interpretation makes all commitments hold at once; "yes" is consistency, "no" is a defect.
The no-contradiction invariant. The defining condition is that no statement and its negation are jointly derivable; where the combination rule supports explosion, an inconsistent set derives everything and so constrains nothing.^[1]
A minimal conflicting subset. When the test fails, the defect localizes to a smallest collection of commitments already jointly unsatisfiable; the locus is typically tiny relative to the whole, which is what makes repair local.
Consistency/truth separation. Joint possibility is distinct from joint correctness: a set can be consistent about a fiction, and a true claim can sit in an inconsistent set.

These compose into a coherence diagnostic: take a set of commitments under a combination rule, test joint satisfiability, and — if it fails — shrink to the minimal conflicting subset and repair there, holding the question of possibility separate from the question of truth.

What It Is Not¶

Not constraint. A constraint is a single commitment that restricts admissible states; consistency is the property of a whole set of constraints — whether they can be jointly satisfied at all. One constraint cannot be inconsistent by itself; consistency is irreducibly a property of the set together.
Not compatibility. Compatibility is pairwise — can these two things co-exist or interoperate? Consistency is the global joint-satisfiability of an entire commitment set, where every pair can be compatible yet a three-way interaction still conflicts (see compatibility).
Not truth or falsifiability. Consistency asks whether commitments are jointly possible, not whether they are correct. A set can be flawlessly consistent about a fiction; a true claim can sit in an inconsistent set. Falsifiability concerns whether evidence could refute a claim — an external-world question, not an internal-coherence one.
Not coherence_breakdown_under_external_interaction. That prime concerns a system losing internal order through coupling to an environment; consistency is a static logical property of a commitment set under its own combination rule, with no environment required.
Not completeness. Completeness asks whether a system decides every question in its scope; consistency asks whether it avoids deciding some question both ways. Gödel's result is that for expressive systems the two pull apart — a consistent system cannot be complete.^[2]
Common misclassification. Mistaking internal coherence for external validity — declaring a theory, alibi, or model vindicated because it harbors no contradiction. The catch: ask whether the worry is "could these all hold together?" or "are these actually so?"; consistency is silent on the second.

Broad Use¶

Mathematics and logic. An axiom set is consistent if no derivation from it yields both a formula and its negation; an inconsistent set trivializes the theory, since from a contradiction everything follows.^[3]
Databases and distributed systems. The constraints of a schema — uniqueness, referential integrity, business rules — must not jointly forbid any state the system is meant to record, and a transaction commits only if the resulting state respects every invariant.^[4]
Law and policy. Statutes, regulations, and contractual clauses can be jointly inconsistent (rule A requires X while rule B forbids X in the same circumstance), and courts and code reviewers resolve such conflicts by ordering, exception, or amendment.^[5]
Narrative and testimony. A witness account, a novel, or a film is internally consistent when its facts and timeline are jointly satisfiable, and detecting an inconsistency is the primary tool of cross-examination and of plot debugging.^[6]
Personal commitments and identity. A person's stated beliefs, promises, and actions form a system that is or is not jointly satisfiable, and cognitive dissonance is the felt cost of detected inconsistency.

Clarity¶

Consistency turns a vague worry — "something here doesn't add up" — into a sharp diagnostic question: does there exist any joint assignment that makes all of the system's commitments hold at once? If the answer is no, the system has at least one defect, and the work becomes the precise task of locating the minimal conflicting subset rather than gesturing at a general sense of unease. The clarifying force is twofold. First, it separates the question of joint possibility (consistency) from the question of truth (soundness), so that one can ask whether a set of claims could all be true together independently of whether they are, which is exactly the question one needs when reasoning about hypotheses, fictions, or proposed rule-sets that are not yet asserted as fact. Second, it converts a holistic complaint about a large body of rules into a localizable one: an inconsistency is not a diffuse property of the whole but a property of some specific small subset, and naming the conflicting subset turns "this policy is incoherent" into "these three clauses, taken together, cannot all be satisfied," which is a statement one can act on.

Manages Complexity¶

Most large systems of rules are far too big to inspect line by line, and the consistency frame supplies the decomposition that makes them tractable: rather than verify the whole at once, find a small unsatisfiable core — a minimal set of commitments that already conflict — and ignore the rest until that conflict is resolved. This "shrink to the conflict" move is the shared engine of SAT solvers, type checkers, constraint propagators, and proof assistants^[7], and it is performed informally by courts narrowing a dispute to the clauses actually in tension and by editors localizing a plot hole to the specific scenes that cannot both stand. The complexity saving is substantial because the locus of a defect is typically tiny relative to the system that contains it: a contradiction among thousands of rules usually involves only a handful, and once that handful is isolated the repair can be local and the remainder left untouched. The frame also manages a subtler complexity — the temptation to over-repair. Knowing that the defect lives in a minimal conflicting subset disciplines the fix to that subset, so one adds a scope qualifier or priority to the few rules actually in conflict rather than rewriting the whole body, which both costs less and avoids introducing new conflicts elsewhere.

Abstract Reasoning¶

Because consistency is defined purely as a property of a set of commitments under a combination rule, the same machinery imports into any domain where commitments combine, and it supports several portable moves. Unsatisfiable-core localization: when a set conflicts, search for the smallest subset that still conflicts, since that subset is the true locus of the defect and patching anything outside it merely hides the problem — if rules A, B, and C jointly conflict but no pair among them does, the fix must address their three-way interaction. Conflict resolution by minimal edit: most inconsistencies dissolve not by wholesale rewriting but by adding a priority ordering, a scope qualifier, or an exception clause that specifies which commitment governs in which context, and this is the same move whether the substrate is a legal code or a software constraint set.^[5] Soundness/consistency separation: keeping "are these jointly possible?" distinct from "are these true?" lets one reason about hypotheticals and proposed rule-sets without first settling their truth, and lets one diagnose whether a system's trouble is internal incoherence or external falsity. Trivialization as alarm: when small changes to a system seem to cascade into arbitrary outcomes — when it begins to "prove anything" — the structural signature is a latent inconsistency rather than newfound generative power, and recognizing that signature redirects the response from celebration to conflict-hunting. Each move is stated in terms of commitments, combination rules, and conflicting subsets, and each redeploys unchanged across the substrates above.

Knowledge Transfer¶

The transferable content of consistency is a small repertoire of interventions that carry across substrates because each attaches to the abstract structure of a commitment set under a combination rule, though in the human cases the property acquires a mild normative undertone — an inconsistency is felt as a "defect" — that its purely formal definition does not strictly carry. The first transferable move is locate the minimal conflicting subset before patching: when several rules jointly conflict but no proper part of them does, the fix lives in their interaction, and patching one rule in isolation may simply relocate the conflict rather than resolve it; this discipline is identical in a legal code, a database schema, and a body of personal commitments. The second is add a priority or scope qualifier rather than a wholesale rewrite: most legal and software inconsistencies dissolve once one specifies which rule takes precedence in which context, and the same minimal-edit strategy that resolves a conflict between two statutes resolves a conflict between two database invariants. The third is detect drift early via assertion-style invariants: the cheapest inconsistency to fix is the one caught the moment it is introduced, which is why type checkers, database constraints, and courtroom objections all work by checking each new commitment against the existing set at the point of entry, and the same logic recommends building consistency checks into any growing body of rules. The fourth is treat trivialization as a red alert: when a small change appears to license arbitrary outcomes, the right inference is a latent contradiction rather than unexpected creativity, and this diagnostic transfers from formal systems to organizational rule-sets that suddenly seem to justify anything. A growing company's vacation policy that simultaneously requires unlimited rollover, caps balances at a fixed maximum, and credits more days than some employees use is jointly unsatisfiable for the light users, and the HR task — find the minimal conflicting subset, then add a scope qualifier such as a capped-rollover-with-payout rule rather than rewriting the policy — is structurally the same operation a compiler performs on conflicting type constraints^[8], a court performs on a docket conflict, and a historian performs on irreconcilable sources.^[9]

Examples¶

Formal/abstract¶

Take the propositional commitment set \(\{p \rightarrow q,\; q \rightarrow r,\; p,\; \neg r,\; s\}\) as a set of commitments held as binding. The combination rule is classical logical inference. Running the joint-satisfiability test — is there a truth assignment satisfying all five? — fails: from \(p\) and \(p \rightarrow q\) derive \(q\); from \(q\) and \(q \rightarrow r\) derive \(r\); but \(\neg r\) is also asserted, yielding \(r \wedge \neg r\), a violation of the no-contradiction invariant. Because classical logic supports explosion, this inconsistent set derives everything, including \(s\) and \(\neg s\) alike, so it constrains nothing. Crucially the defect localizes to a minimal conflicting subset: \(\{p \rightarrow q,\; q \rightarrow r,\; p,\; \neg r\}\) is jointly unsatisfiable, but no proper subset of it is — drop any one member and the rest are satisfiable.^[7] The commitment \(s\) is entirely innocent and lies outside the core. This is unsatisfiable-core localization in its purest form, and it dictates conflict resolution by minimal edit: the repair must address the four-way interaction (e.g., retract \(\neg r\) or qualify the scope of \(q \rightarrow r\)), and patching \(s\) would merely hide nothing, since \(s\) was never the problem. The consistency-versus-truth separation also shows here: the set's defect is internal incoherence, independent of whether any of \(p, q, r\) is actually true in the world.

Mapped back: The propositional example instantiates the full signature — a binding commitment set under inference, a failed satisfiability test, the explosion that voids constraint, and a minimal conflicting subset that localizes both diagnosis and minimal-edit repair while truth stays separate.

Applied/industry¶

A relational database schema is a commitment set whose combination rule is query/constraint evaluation, and the DBMS enforces consistency continuously. Suppose an orders table carries a foreign key to customers, a CHECK (total >= 0) constraint, a uniqueness constraint on order IDs, and a business rule (a trigger) that every order with status shipped must reference a non-null ship_date. A transaction attempting to mark an order shipped while leaving ship_date null fails the joint-satisfiability test: the proposed state violates the no-contradiction invariant against the trigger constraint, and the DBMS detects drift early by rejecting the commit at the point of entry rather than allowing an incoherent state to persist. The defect localizes to a minimal conflicting subset — here just the status value and the null ship-date against one rule — so the minimal-edit repair is local (supply a ship-date or revert the status), not a schema rewrite. The identical structure governs a legal/policy substrate: a company's leave policy that simultaneously promises unlimited rollover, caps balances at a fixed maximum, and credits more days than light users consume is jointly unsatisfiable for those users; HR's task is to find the minimal conflicting subset and add a scope qualifier (capped-rollover-with-payout) which precedes a wholesale rewrite — the same operation a court performs when narrowing a statutory conflict to the two clauses actually in tension and resolving by priority ordering.

Mapped back: Database constraint enforcement and policy/legal conflict resolution both test joint satisfiability against a binding rule-set, catch violations at entry, localize to a minimal conflicting subset, and repair by minimal scoped edit — instantiating the consistency diagnostic in data-systems and institutional substrates.

Structural Tensions¶

T1 — Consistency versus Truth (scopal). The prime tests joint possibility, not joint correctness; a set can be flawlessly consistent about a falsehood and a true claim can sit in an inconsistent set. The competing concern is soundness. The failure mode is mistaking internal coherence for external validity — declaring a theory, alibi, or model vindicated because it harbors no contradiction, when it may be consistently wrong. Diagnostic: ask whether the worry is "could these all hold together?" or "are these actually so?"; if the latter, consistency is necessary but silent, and certifying coherence answers a different question than the one that matters.

T2 — Consistency versus Completeness (logical). Gödel's boundary: for sufficiently expressive systems, consistency and completeness pull apart — a consistent system cannot prove all its truths, and forcing completeness risks contradiction. The failure mode is demanding a rule-set that is both contradiction-free and decides every case, then patching gaps with ad hoc rules that quietly reintroduce conflict. Diagnostic: when an apparently consistent system is pressed to settle every question, ask whether the new deciding rules conflict with existing ones; the drive to close gaps is a common route by which a consistent system is made inconsistent.

T3 — Local Conflict versus Global Repair (scalar/local-global). The defect localizes to a tiny minimal conflicting subset, which tempts a purely local fix. But a minimal scoped edit to those few rules can interact with distant commitments and spawn a new conflict elsewhere. The failure mode is whack-a-mole repair: patching the isolated core relocates rather than resolves the incoherence, because the edit's consequences propagate beyond the subset. Diagnostic: after a local fix, re-run joint satisfiability on the whole; if resolving one minimal core opens another, the conflict was a symptom of a deeper structural tension the local edit only displaced.

T4 — Classical Explosion versus Paraconsistent Tolerance (combination-rule dependence). The alarm — an inconsistent set "proves everything" — depends on the combination rule supporting explosion. Under paraconsistent or relevance logics, or in human reasoning that quarantines contradictions, a contradiction does not trivialize the whole. The failure mode is over-reacting (treating a localized inconsistency in a non-explosive system as total collapse) or under-reacting (assuming a classical system can safely harbor a contradiction). Diagnostic: ask whether the combination rule actually licenses ex falso; if it does, any contradiction is catastrophic, but if it does not, inconsistency may be locally containable rather than system-voiding.

T5 — Static Snapshot versus Accumulating Commitments (temporal). Consistency is tested on a set, but real commitment-bases grow, and each addition can introduce a conflict with what is already held. The failure mode is checking once and assuming permanence — certifying a policy, schema, or belief-set coherent today and acting as if it stays so as clauses, records, and promises accrete. Diagnostic: ask whether new commitments are checked against the existing set at the point of entry; the cheapest inconsistency to fix is the one caught on insertion, and a system that batch-checks rarely accumulates latent contradictions between audits.

T6 — Maximal Consistency versus Informativeness (sign/direction). A set is most trivially consistent when it commits to the least — the empty set forbids nothing and contradicts nothing. There is a tension between strengthening commitments (more content, more constraint, more risk of conflict) and preserving consistency (safest when weakest). The failure mode is buying coherence by retreating into vagueness — qualifying every rule until nothing can conflict because nothing definite is claimed. Diagnostic: ask whether consistency was achieved by resolving the conflict or by hollowing out the commitments; a rule-set that never conflicts because it never commits has purchased coherence at the price of saying nothing.

Structural–Framed Character¶

Consistency sits firmly at the structural end of the structural–framed spectrum, with a near-zero aggregate carrying only a single mild qualification, consistent with its structural label.

Four of the five diagnostics read cleanly structural. The pattern carries no home vocabulary that must travel with it: the joint-non-derivability-of-contradiction question is told in a logician's "no \(p\) and not-\(p\)," a DBA's "no state violates the invariants," a lawyer's "these clauses cannot all be satisfied," and an editor's "this timeline doesn't cohere," each in its own field's words. Its origin is formal — a property of a commitment set under a combination rule, with no institutional pedigree required. It is not bound to a human practice: a database engine tests joint satisfiability at every commit, and an axiom set is consistent or not entirely independently of any reasoner, so the property runs in formal substrates indifferently. And invoking it largely recognizes a property already latent in the rule-set — the minimal conflicting subset is there to be found whether or not anyone names it — rather than importing an interpretive frame.

The one diagnostic that nudges off zero is evaluative weight. In its human applications — a witness whose account "doesn't add up," a person feeling cognitive dissonance, a policy called "incoherent" — inconsistency is felt as a defect, a failure rather than a neutral fact, and that faint disapproving undertone is what the rationale flags and what lifts the aggregate to a hair above the structural floor. But this is genuinely mild: at the formal core consistency is value-neutral (a set can be flawlessly consistent about a fiction, and a true claim can sit in an inconsistent set), the entry keeps consistency sharply separate from truth, and the "defect" coloring attaches only when the commitments are someone's binding norms rather than abstract propositions. The relational skeleton dominates and the evaluative tinge is a thin overlay, which is exactly why the grade stays structural rather than drifting toward the framed side.

Substrate Independence¶

Consistency is a strongly substrate-independent prime — composite 4 / 5 on the substrate-independence scale. Its signature is defined without reference to what the commitments are about — a set of commitments held as binding, a combination rule for evaluating them jointly, and the no-contradiction invariant that no statement and its negation are jointly derivable — and that purely structural definition is what lets the property travel and be recognized rather than translated. The breadth is genuine: non-derivability of contradiction operates with the same structural force on an axiom set in logic, on the uniqueness and referential-integrity invariants of a database schema, on jointly-conflicting statutes in law, on the timeline of a witness account or a novel, and on a person's stated beliefs and promises, where cognitive dissonance is the felt cost of detected inconsistency. The abstraction is high — the "shrink to the minimal conflicting subset and repair there" move is the shared engine of SAT solvers, type checkers, courtroom narrowing, and plot debugging, stated entirely in terms of commitments and combination rules. The transfer is concrete and documented: unsatisfiable-core localization, conflict resolution by minimal scoped edit, and early drift-detection at the point of entry all port intact across formal and institutional substrates. What holds the composite at 4 rather than 5 is a mild evaluative undertone in the human cases — an inconsistency is felt as a "defect," a failure rather than a neutral fact — that the purely formal definition does not strictly carry, plus the fact that consistency's force partly depends on the combination rule supporting explosion (paraconsistent logics and contradiction-quarantining human reasoning soften it). Strong breadth, abstraction, and transfer, just shy of the value-neutral universal ceiling.

Composite substrate independence — 4 / 5
Domain breadth — 4 / 5
Structural abstraction — 4 / 5
Transfer evidence — 4 / 5

Relationships to Other Abstractions¶

Current abstraction Consistency Prime

Parents (1) — more general patterns this builds on

Consistency presupposes Constraint Prime

'Consistency is a META-property of a COLLECTION of constraints' — whether the intersection of all their admissible regions is nonempty.

Children (2) — more specific cases that build on this

Bootstrap model Domain-specific is a kind of Consistency

The proposed strict upward parent is prime:consistency.
MERSI protocol Domain-specific is a kind of Consistency

The proposed strict upward parent is prime:consistency.

Hierarchy path (1) — routes to 1 parentless root

Consistency → Constraint

Neighborhood in Abstraction Space¶

Consistency sits among the more crowded primes in the catalog (7^th percentile for distinctiveness): several abstractions describe nearly the same structure, so a description that fits it will tend to fit its neighbors too — transporting it usually means disambiguating within this family rather than landing on it exactly.

Family — Distributed Consistency & Shared State (11 primes)

Nearest neighbors

Contradiction — 0.80
Consistency Model — 0.77
Eventual Consistency — 0.76
Unity Test — 0.75
Axiom — 0.75

Computed from structural-signature embeddings · 2026-09-10

Not to Be Confused With¶

Consistency's nearest neighbor is constraint, and the two are so intertwined that a commitment set just is a set of constraints — yet they sit at different structural levels. A constraint is a single restriction: it carves the space of admissible states by forbidding some of them. Consistency is a meta-property of a collection of constraints: whether the intersection of all their admissible regions is nonempty, so that some state satisfies every constraint at once. The level difference is decisive. A lone constraint is never "inconsistent" — it simply restricts; inconsistency arises only from the joint demands of two or more constraints whose admissible regions do not overlap. This is why the repair vocabulary differs: one tightens or loosens a single constraint, but one diagnoses a consistency failure by locating the minimal conflicting subset — the smallest group of constraints whose combined demands already exclude every state. A practitioner who treats consistency as a property of individual rules will hunt for "the bad rule" when in truth each rule may be unobjectionable and only their conjunction conflicts.

A subtler and more frequently-made error is confusing consistency with compatibility, because both are about things "going together." Compatibility is fundamentally pairwise: can A and B co-exist, interoperate, or hold simultaneously? Consistency is global joint-satisfiability over an entire set, and the gap between them is exactly the phenomenon of higher-order conflict. A commitment set can be pairwise compatible — every two members satisfiable together — while being globally inconsistent, because it takes the conjunction of three (or more) to force the contradiction. The propositional set in which \(A\), \(B\), and \(C\) conflict three-ways but no pair among them does is the canonical illustration. The practical consequence is that checking compatibility pair by pair gives a false assurance of coherence; consistency demands the joint test, and the minimal conflicting subset can be larger than any pair. Treating pairwise compatibility as sufficient for systemic consistency is among the most common reasoning errors in rule-set design, schema validation, and policy drafting.

Consistency is also worth separating sharply from completeness, with which it forms the famous Gödelian pair. Completeness asks whether a system settles every question in its scope — for each statement, either it or its negation is derivable. Consistency asks whether the system avoids settling any question both ways — never deriving both a statement and its negation. These are not only distinct but in tension: for sufficiently expressive systems they cannot both hold, so a consistent system must leave some truths unprovable, and a drive toward completeness (patching every gap with a new deciding rule) is a common route by which a consistent system is quietly made inconsistent. The confusion is dangerous in practice because a rule-set author who demands that the rules "cover every case" is pursuing completeness, and may not notice that each gap-filling addition risks a fresh conflict with the existing commitments. Keeping the two questions explicitly apart — does it decide enough? versus does it decide too much in opposite directions? — is what prevents the over-repair failure.

For a practitioner the cluster resolves by tracking what each property is about. A constraint is about restricting states; consistency is about a set of constraints being jointly satisfiable; compatibility is about pairwise co-existence and undersells systemic conflict; completeness is about deciding every case and pulls against consistency. The unifying discipline is to test joint satisfiability over the whole set rather than rule-by-rule or pair-by-pair, to localize any failure to its minimal conflicting subset, and to keep the question of joint possibility (consistency) firmly separate from joint correctness (truth) and from total coverage (completeness) — three different questions a coherent commitment-base must each answer in its own terms.

Solution Archetypes¶

Solution archetypes in the catalog that build on this prime — directly (this prime is a source ingredient) or as a related prime.

Built directly on this prime (6)

Also a related prime in 16 archetypes

Additive Measure-Space Design: Make size assignable and composable by declaring what subsets are measurable and how disjoint sizes add.
Assumption-Bounded Distributed Agreement: Make distributed agreement achievable by declaring the fault, timing, membership, and validity model, preserving safety when progress is uncertain, and using only decision evidence that is valid under those assumptions.
Asynchronous Replica Convergence: Let replicas make bounded local progress without continuous coordination, then force equivalent outcomes through explicit causal context, deterministic merge, repair, and a verifiable convergence contract.
Dispute-Question Alignment: Stop arguing over answers until the parties have identified which kind of question they are actually contesting.
Durable Identifier Binding: Create a durable handle for a referent, bind it in an authoritative record, and maintain enough lookup, lifecycle, and audit rules that later references can rely on the handle without re-describing the entity.
Fault-Tolerant Distributed Consensus: Declare the fault and timing model, preserve agreement and validity with intersecting evidence, and pursue termination only under assumptions that make progress possible.
Formal Derivation System Design: Turn reasoning into an explicit symbolic machine by fixing symbols, well-formedness rules, axioms, inference rules, and derivation checks.
Informal Fallacy Diagnosis and Repair: Repair arguments that can look formally valid but fail because their premises, context, relevance, or category moves are defective.
LIFO Stack Discipline: Use a last-in, first-out nesting discipline whenever safe work depends on closing the current context before returning to the one beneath it.
Part-Whole Unity Criterion Design: Make the rule for when parts count as one whole explicit, testable, and consequentially bounded.

▸ Show 6 more

References¶

[1] Priest, Graham. In Contradiction: A Study of the Transconsistent. 2^nd ed. Oxford: Oxford University Press, 2006. Analyzes the principle of explosion (ex contradictione quodlibet) and paraconsistent alternatives, establishing that classical inconsistency trivializes a theory. registry ↩a ↩b

[2] Gödel, Kurt. "Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I." Monatshefte für Mathematik und Physik, vol. 38 (1931): 173–198. Proves that a sufficiently expressive consistent formal system cannot be complete. registry ↩

[3] Mendelson, Elliott. Introduction to Mathematical Logic. 6^th ed. Boca Raton: CRC Press, 2015. Standard treatment of consistency of axiom sets and the derivation of all formulas from a contradiction. registry ↩

[4] Date, C. J. An Introduction to Database Systems. 8^th ed. Boston: Addison-Wesley, 2003. Defines integrity constraints, referential integrity, and the requirement that a transaction commit only into a consistent state. registry ↩

[5] Raz, Joseph. The Authority of Law: Essays on Law and Morality. Oxford: Clarendon Press, 1979. Treats conflicts and inconsistencies among legal norms and their resolution by priority, exception, and amendment. registry ↩a ↩b

[6] Wigmore, John Henry. The Science of Judicial Proof, as Given by Logic, Psychology, and General Experience. 3^rd ed. Boston: Little, Brown, 1937. Foundational treatment of detecting inconsistency in testimony as the basis of cross-examination. registry ↩

[7] Biere, Armin, Marijn Heule, Hans van Maaren, and Toby Walsh, eds. Handbook of Satisfiability. Amsterdam: IOS Press, 2009. Reference on SAT solving, unsatisfiable cores, and the minimal-conflict-set localization used by constraint engines. registry ↩a ↩b

[8] Pierce, Benjamin C. Types and Programming Languages. Cambridge: MIT Press, 2002. Standard reference on type systems; treats conflicting type constraints and the checker's role in rejecting inconsistent constraint sets. registry ↩

[9] Bloch, Marc. The Historian's Craft. Translated by Peter Putnam. New York: Alfred A. Knopf, 1953. Foundational treatment of historical source criticism, including the cross-examination and reconciliation of contradictory primary sources to determine which can jointly stand. registry ↩