Foundation Primitive Recognition Calculus Inevitability Prc Inevitability Certif

The inevitability certificate

The declaration prc_inevitability_certificate is a formal result inside the Recognition Science framework's machine-checked library of formal theorems. It establishes a conditional inevitability: if a formal system can express the distinction between two distinct endpoints, then that system already embeds a primitive recognition calculus, the framework's basic discrete record of events. The proof is closed, meaning it relies only on the framework's own axioms and the standard logical postulates of the ambient type theory, not on any additional assumptions.

The certificate bundles several component theorems into one structure. The central one, any_foundation_presupposes_distinction, proves the inevitability target: for every admissible foundation, there exists an embedding of the primitive recognition calculus into that foundation's formal system. An admissible foundation is defined as any formal system that is expressive enough to distinguish the two endpoints of δ, the framework's basic distinction. The certificate also shows that the primitive recognition calculus itself qualifies as an admissible foundation, and that it embeds into itself.

What the certificate does not claim is just as important as what it proves. The theorem applies only to systems that have already been parsed into the framework's admissible interface. The external parsing workload, turning an arbitrary external formal system into an expressive formal system through a faithful-parse relation, is named separately as an open target, not hidden inside the theorem. The certificate explicitly records this separation: the admissible-interface theorem is closed, while the external parsing remains a named, unfinished task.

In plain terms, the certificate says the framework's core calculus is unavoidable once you have a system that can tell two things apart. It does not say that every formal system in existence has already been shown to contain it, because that requires the separate parsing step. The distinction matters: the inevitability is proved for the interface, while the application to any particular external system remains a target for future work.

/-- 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 PRCAdmissibleFoundation_embeds :
    Nonempty (PRCEmbeddingInto PRCAdmissibleFoundation.system) :=
  any_foundation_presupposes_distinction PRCAdmissibleFoundation

What this page does not claim

The certificate does not claim that every external formal system has been shown to embed the primitive recognition calculus. It does not claim that the parsing of any specific external foundation has been completed. It does not claim that the theorem applies to systems that cannot distinguish two distinct endpoints.

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: