Foundation Primitive Recognition Calculus Prctype Theory Parse Tt System Not Deg

The non-degenerate parse

In the Recognition Science framework, the foundational claim is that reality keeps a discrete record of recognition events, and that the cost of each recognition is forced by a small set of conditions. Before any physics can be derived from that idea, the framework must show its own primitive calculus can be expressed inside an existing, trusted mathematical system. The declaration ttSystem_not_degenerate is the machine-checked proof that such an expression is possible: it establishes that the two-element type of Martin-Löf type theory, the same two-valued logic that underlies most constructive mathematics, is not a degenerate instance of the framework's formal system.

To see what that means, consider the two-element type with its two closed terms, usually called false and true. The framework first proves two classical facts about this type: every closed term is either false or true, and false is not equal to true. These are not empirical observations but theorems in the machine-checked library, proved by direct computation on the type's constructors. The framework then defines a formal system whose tokens are exactly these two terms, whose expressions are natural numbers, and whose discrimination relation is term inequality. This system is called ttSystem, and the theorem ttSystem_not_degenerate proves that it is not degenerate, meaning it genuinely distinguishes between its two tokens rather than collapsing them into one.

The proof of non-degeneracy runs through a stronger result: the framework's primitive recognition calculus, its δ core, embeds into ttSystem. An embedding here means a structure-preserving map from the framework's own formal system into the two-valued one, showing that every distinction the framework's calculus can make, the two-element type can also make. Since the δ core is the framework's basic recognition engine, this embedding is what lets the framework claim its primitive calculus is not an empty formalism but a real structure that lives inside standard type theory.

What the theorem does not claim is just as important. It does not claim that the two-element type is the only non-degenerate formal system, nor that it is the preferred one. It does not claim that the framework's full forcing chain, with its golden ratio, eight-tick cycle, and three spatial dimensions, is already proved inside the two-element type. The embedding covers only the δ core, the primitive recognition calculus, not the later theorems built on top of it. And it does not claim that the two-element type itself is the ledger of reality; it claims only that the framework's primitive calculus can be faithfully expressed within it.

The consequence is a matter of foundation hygiene. A framework that derives physics from recognition events must first show its own primitive language is coherent and can be hosted in a trusted mathematical setting. That is what ttSystem_not_degenerate delivers: a machine-checked guarantee that the framework's basic calculus is not vacuous, that it can distinguish its own tokens, and that it fits inside the two-valued logic that mathematics already trusts.

/-- **Canonicity.** Every closed term of `𝟚` is one of the two canonical
constructors. The type has exactly two inhabitants. -/
theorem canonicity (b : Two) : b = false ∨ b = true := by
  cases b
  · exact Or.inl rfl
  · exact Or.inr rfl

/-- **No-confusion / constructor disjointness.** The two canonical terms are
distinct: this is the recursor's verdict, the type theory's own distinction. -/
theorem no_confusion : (false : Two) ≠ true := by decide

/-- **MLTT contains the δ core.** -/
theorem ttSystem_embeds_delta : Nonempty (PRCEmbeddingInto ttSystem) :=
  FormalSystemEmbeddingTarget_proved ttSystem ttSystem_expressive

theorem ttSystem_not_degenerate : ¬ DistinctionDichotomy.Degenerate ttSystem :=
  DistinctionDichotomy.not_degenerate_of_realizesDelta ttSystem ttSystem_embeds_delta

What this page does not claim

The theorem does not claim the two-element type is the only non-degenerate formal system. It does not claim the full forcing chain of Recognition Science theorems is proved inside the two-element type. It does not claim the two-element type itself is the ledger of reality, only that the primitive calculus embeds into it.

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/PRCTypeTheoryParse.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: