Foundation Primitive Recognition Calculus Prcdistinction Dichotomy Distinction D

The dichotomy

In logic and mathematics, a formal system, a set of symbols and rules for combining them, either has the power to distinguish between two of its objects or it does not. The distinction_dichotomy theorem in the Recognition Science framework's machine-checked library of formal theorems proves that for any such system with a reflexive expression order, meaning every expression extends itself, this is a strict either/or. There is no middle ground where a system can distinguish some things but not be capable of the full primitive recognition calculus, the framework's basic structure for how a system records distinctions.

The theorem's two sides have plain names. A degenerate foundation is one whose discrimination relation is empty: it cannot tell any two objects apart. A discriminating foundation can tell at least one pair apart. The proof shows these are exact negations, and then goes further. If a discriminating foundation also has the reflexive property, it can be shown to realize the δ core, meaning the full primitive recognition calculus can be embedded into its own interface. The dichotomy then follows directly: any foundation with a reflexive expression order is either degenerate or realizes δ.

This result is not vacuous. The framework's library proves that four named foundations, logic, arithmetic, set theory, and type theory, all fall on the discriminating side. Each is non-degenerate and therefore realizes δ. The only foundation that escapes the dichotomy is the one that distinguishes nothing at all, which cannot express a single non-trivial proposition. The theorem's headline is that distinction is not optional, except for that degenerate case.

In Recognition Science, this dichotomy is a load-bearing step. It shows that any serious foundation, any system that can make even one distinction, is forced to contain the full primitive recognition calculus. The framework does not claim this dichotomy proves anything about which distinctions a system makes, nor does it claim that the degenerate foundation is impossible. It only establishes the binary structure: you either distinguish or you do not, and if you do, the full calculus is already there.

/-- **The dichotomy.** Any foundation with a reflexive expression order is either
degenerate or realizes δ. -/
theorem distinction_dichotomy (F : FormalSystem) (hrefl : ExprReflexive F) :
    Degenerate F ∨ RealizesDelta F := by
  by_cases h : Discriminating F
  · exact Or.inr (realizesDelta_of_discriminating F h hrefl)
  · exact Or.inl (fun a b hab => h ⟨a, b, hab⟩)

/-- Degeneracy and discrimination are exact negations. -/
theorem not_degenerate_iff_discriminating (F : FormalSystem) :
    ¬ Degenerate F ↔ Discriminating F := by
  constructor
  · intro h
    by_contra hc
    exact h (fun a b hab => hc ⟨a, b, hab⟩)
  · rintro ⟨a, b, hab⟩ hdeg
    exact hdeg a b hab

/-- The four named foundations (logic, arithmetic, set theory, type theory) all
fall on the δ side of the dichotomy: each is non-degenerate, hence realizes δ. -/
theorem named_foundations_not_degenerate :
    ¬ Degenerate InevitabilityInstances.boolLogicSystem
      ∧ ¬ Degenerate InevitabilityInstances.peanoSystem
      ∧ ¬ Degenerate InevitabilityInstances.setFoundationSystem
      ∧ ¬ Degenerate InevitabilityInstances.typeTheorySystem :=
  ⟨not_degenerate_of_realizesDelta _ InevitabilityInstances.boolLogicSystem_embeds_delta,
    not_degenerate_of_realizesDelta _ InevitabilityInstances.peanoSystem_embeds_delta,
    not_degenerate_of_realizesDelta _ InevitabilityInstances.setFoundationSystem_embeds_delta,
    not_degenerate_of_realizesDelta _ InevitabilityInstances.typeTheorySystem_embeds_delta⟩

What this page does not claim

The dichotomy does not claim that a discriminating foundation must make any particular distinction. It does not claim that the degenerate foundation is impossible or inconsistent. It does not claim that the reflexive expression order condition is satisfied by every conceivable formal system.

Verify this page

Every tagged claim above names its theorem. To check one yourself rather than trust this page, elaborate the source module with Lean 4 and audit its axiom basis:

$ lake env lean IndisputableMonolith/Foundation/PrimitiveRecognitionCalculus/PRCDistinctionDichotomy.lean
expected axiom basis: [propext, Classical.choice, Quot.sound] (the Lean kernel's standard three; no RS-specific axioms)

A page whose claims cannot be reproduced this way does not ship. In production, every anchor links to the exact declaration in the public source release, and this block carries the build receipt for the page itself.

Derived articles

This page is generated by a question-recursion engine: the questions its answers raise become the next pages. The current agenda, with open targets marked red: