Foundation Primitive Recognition Calculus Inevitability Prcadmissible Foundation

The embedding theorem

A formal system is a set of symbols and rules for manipulating them. An expressive formal system is one that can distinguish between two different objects, such as the two endpoints of a symbol δ. The declaration PRCAdmissibleFoundation_embeds proves a theorem about such systems: it shows that the primitive recognition calculus (PRC), the framework's basic ledger of discrete recognition events, can be embedded into its own formal system.

The theorem is a direct consequence of a more general result. That result, any_foundation_presupposes_distinction, proves that every expressive formal system already contains an embedding of the PRC. The argument is simple: if a system can distinguish two endpoints, it has the expressive power to host the PRC's core structure. Since the PRC's own formal system is expressive, the embedding theorem follows immediately.

In Recognition Science, this theorem is the first step of an inevitability argument. The framework models reality as a ledger, a discrete record of recognition events, and the theorem shows that any sufficiently expressive formal foundation already contains this ledger structure. The theorem is machine-checked in the framework's library of formal theorems, meaning its proof has been verified by a computer.

The theorem does not claim that every external foundation, such as set theory or type theory, has been parsed into the framework's interface. That is a separate target, named ExternalFoundationParsingTarget, which remains open. The theorem also does not claim that the PRC is the only possible foundation, only that it is present in any expressive one.

theorem PRCAdmissibleFoundation_embeds :
    Nonempty (PRCEmbeddingInto PRCAdmissibleFoundation.system) :=
  any_foundation_presupposes_distinction PRCAdmissibleFoundation

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

What this page does not claim

The theorem does not prove that any external foundation, such as set theory or type theory, has been parsed into the framework's interface. The theorem does not claim the PRC is the only possible foundation, only that it is present in any expressive one.

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: