Encyclopedia Foundation Foundation Primitive Recognition Calculus Inevitability Any Foundation Presuppos
ARTICLE 4 claims 3 theorems 1 open
Foundation Primitive Recognition Calculus Inevitability Any Foundation Presuppos
Every formal system that can tell two different symbols apart already contains the seed of Recognition Science's primitive calculus.
The presupposed distinction
A formal system is a set of symbols and rules for manipulating them. The distinction between two different symbols is the most basic act such a system can perform. Recognition Science's ledger, a discrete record of events, begins with this same act: telling one thing from another. The declaration any_foundation_presupposes_distinction states that any formal system expressive enough to distinguish two specific endpoints, called δ, already contains a faithful copy of the primitive recognition calculus (PRC). This is a proved result, not an assumption.
The result is precise about its condition. It does not apply to every formal system. It applies to an admissible foundation: a formal system that is expressive enough to distinguish the two endpoints of δ. The proof shows that for any such system, a faithful embedding of the PRC exists within it. The PRC is itself an admissible foundation, so the result also shows that the PRC embeds into itself, a consistency check.
What this establishes is a kind of inevitability within the framework. Any foundation that meets the expressiveness condition already has the primitive recognition calculus available inside it. The framework models the cost of recognition as forced, and this result is the first step in that forcing chain: the basic ability to distinguish is not optional for such a foundation, it is presupposed.
The result does not claim that every actual foundation in the world, such as a particular axiom system or a particular programming language, has been checked. That remains an external parsing target. The result is closed for the admissible interface, but applying it to any specific external foundation requires a faithful parse of that foundation into an expressive formal system. That parsing workload is named separately, not hidden inside the result.
The consequence is that the primitive recognition calculus is not a foreign object imposed on other foundations. It is already there, once the basic distinction is possible. This is what makes the first inevitability result a statement about the structure of formal systems generally, rather than a claim about one particular system.
THEOREM any_foundation_presupposes_distinction · AdmissibleFoundation · IndisputableMonolith/Foundation/PrimitiveRecognitionCalculus/Inevitability.lean
/-- Any foundation already parsed into the admissible interface presupposes a
PRC trace core. -/
theorem any_foundation_presupposes_distinction :
PRCInevitabilityTarget := by
intro A
exact FormalSystemEmbeddingTarget_proved A.system A.expressive
/-- An admissible foundation for the first inevitability theorem is a formal
system that is expressive enough to distinguish the two endpoints of δ. -/
structure AdmissibleFoundation where
system : FormalSystem
expressive : system.Expressive
THEOREM AdmissibleFoundation · IndisputableMonolith/Foundation/PrimitiveRecognitionCalculus/Inevitability.lean
/-- An admissible foundation for the first inevitability theorem is a formal
system that is expressive enough to distinguish the two endpoints of δ. -/
structure AdmissibleFoundation where
system : FormalSystem
expressive : system.Expressive
THEOREM PRCAdmissibleFoundation · PRCAdmissibleFoundation_embeds · IndisputableMonolith/Foundation/PrimitiveRecognitionCalculus/Inevitability.lean
/-- PRC itself is an admissible foundation in this interface. -/
def PRCAdmissibleFoundation : AdmissibleFoundation where
system := PRCFormalSystem
expressive := PRCFormalSystem_expressive
theorem PRCAdmissibleFoundation_embeds :
Nonempty (PRCEmbeddingInto PRCAdmissibleFoundation.system) :=
any_foundation_presupposes_distinction PRCAdmissibleFoundation
What this page does not claim
The result does not claim that every specific external foundation has been parsed and checked. The result does not derive the cost function J or the golden ratio. The result does not claim that the primitive recognition calculus is the only possible primitive calculus.
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/Inevitability.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:
- What exactly are the two endpoints of δ and how are they distinguished in practice?
- What does a faithful parse of a particular external foundation into a formal system look like?
- What is the next step in the forcing chain after the primitive recognition calculus is embedded?
MACHINE LAYER · GROUNDED CLAIM TABLE · CLICK TO EXPAND
THEOREM any_foundation_presupposes_distinction · AdmissibleFoundation · IndisputableMonolith/Foundation/PrimitiveRecognitionCalculus/Inevitability.lean
/-- Any foundation already parsed into the admissible interface presupposes a PRC trace core. -/ theorem any_foundation_presupposes_distinction : PRCInevitabilityTarget := by intro A exact FormalSystemEmbeddingTarget_proved A.system A.expressive/-- An admissible foundation for the first inevitability theorem is a formal system that is expressive enough to distinguish the two endpoints of δ. -/ structure AdmissibleFoundation where system : FormalSystem expressive : system.ExpressiveThe result shows that any formal system expressive enough to distinguish the two endpoints of δ already contains a faithful copy of the primitive recognition calculus. any_foundation_presupposes_distinction · AdmissibleFoundation · IndisputableMonolith/Foundation/PrimitiveRecognitionCalculus/Inevitability.leanTHEOREM AdmissibleFoundation · IndisputableMonolith/Foundation/PrimitiveRecognitionCalculus/Inevitability.lean
/-- An admissible foundation for the first inevitability theorem is a formal system that is expressive enough to distinguish the two endpoints of δ. -/ structure AdmissibleFoundation where system : FormalSystem expressive : system.ExpressiveAn admissible foundation is a formal system that is expressive enough to distinguish the two endpoints of δ. AdmissibleFoundation · IndisputableMonolith/Foundation/PrimitiveRecognitionCalculus/Inevitability.leanTHEOREM PRCAdmissibleFoundation · PRCAdmissibleFoundation_embeds · IndisputableMonolith/Foundation/PrimitiveRecognitionCalculus/Inevitability.lean
/-- PRC itself is an admissible foundation in this interface. -/ def PRCAdmissibleFoundation : AdmissibleFoundation where system := PRCFormalSystem expressive := PRCFormalSystem_expressivetheorem PRCAdmissibleFoundation_embeds : Nonempty (PRCEmbeddingInto PRCAdmissibleFoundation.system) := any_foundation_presupposes_distinction PRCAdmissibleFoundationThe PRC is itself an admissible foundation, so the result also shows that the PRC embeds into itself. PRCAdmissibleFoundation · PRCAdmissibleFoundation_embeds · IndisputableMonolith/Foundation/PrimitiveRecognitionCalculus/Inevitability.lean- OPENApplying the result to any specific external foundation requires a faithful parse of that foundation into an expressive formal system.