Foundation Primitive Recognition Calculus Prcdistinction Dichotomy Named Foundat

The named foundations

A foundation of mathematics is a formal system: a collection of tokens and rules for deriving expressions. The classical examples are logic, arithmetic, set theory, and type theory. A foundation is degenerate if its discrimination relation is empty: it cannot tell any two objects apart. The theorem named_foundations_not_degenerate establishes that the four named foundations are all non-degenerate, meaning each can distinguish at least one pair of objects.

The proof rests on a dichotomy. For any formal system with a reflexive expression order, the framework proves it is either degenerate or it realizes the δ core, a primitive recognition calculus embedding into its own interface. A discriminating foundation, one that can tell at least one pair apart, realizes the δ core. The four named foundations all satisfy the mild hypothesis of reflexivity and are all discriminating, so they all fall on the δ side.

In Recognition Science, this is a statement about the ledger, a discrete record of recognition events. The theorem says that the standard foundations cannot be empty ledgers; they must register distinctions. The only foundation that escapes this is the degenerate one, which distinguishes nothing and cannot express a single non-trivial proposition.

The theorem does not claim that these foundations are equivalent, that they exhaust all possible foundations, or that their non-degeneracy implies any particular content beyond the ability to distinguish. It is a structural result about the minimal condition for a foundation to be non-trivial.

/-- 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⟩

/-- A foundation distinguishes nothing: its discrimination relation is empty. It
cannot tell any two objects apart. -/
def Degenerate (F : FormalSystem) : Prop := ∀ a b : F.Token, ¬ F.distinguishes a b

/-- **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⟩)

What this page does not claim

The four named foundations are equivalent or reducible to each other. The theorem identifies which specific pair of objects each foundation can distinguish. The theorem implies any foundation is non-degenerate; the degenerate case remains possible.

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: