formal_system_certificate
plain-language theorem explainer
Step 12 of the Primitive Recognition Calculus foundation closes the formal-system surface: PRC is a nonempty formal system (tokens = endpoints, expressions = finite traces), it is expressive, it embeds into itself, and every expressive formal system admits a PRC embedding. Foundation auditors cite this when assembling the kernel and universal-foundation certificates. The proof is a pure structure inhabitant wiring already-proved lemmas plus a reflexivity strength tag.
Claim. The formal-system certificate is inhabited: the PRC system (tokens are endpoints, expressions are finite traces, extension is trace extension) witnesses a nonempty formal-system surface; that system is expressive; there is a PRC embedding into it; the embedding-target property holds (every expressive formal system $F$ admits a nonempty PRC embedding into $F$); and the strength tag equals the delta-only tag.
background
In the Primitive Recognition Calculus formal-system layer, a formal system packages tokens, expressions, a distinguishability relation, and an expression-extension relation, together with maps that send endpoints to tokens and traces to expressions. PRC itself is realized as the minimal such system: tokens are endpoints, expressions are finite traces, distinguishability is inequality, and extension is trace extension.
Expressiveness is the minimal separation property needed for embeddings (here discharged by the fact that the two endpoint polarities are distinct). A PRC embedding into a formal system $F$ is a structure-preserving map of the PRC surface into $F$. The embedding-target theorem states that every expressive $F$ admits such an embedding, via the constructor that builds the embedding from expressiveness alone.
The certificate structure packages surface existence, PRC expressiveness, the self-embedding, the general embedding-target fact, and a trivial strength-tag equality. Its doc-comment marks this as Step 12: the surface and embedding theorem are closed here; universality over external foundations is deferred.
proof idea
Term-mode structure construction for FormalSystemCertificate. The surface field is the singleton nonempty witness ⟨PRCFormalSystem⟩. Expressiveness is the already-proved lemma that reduces to endpoint polarity separation. The self-embedding is the lemma that applies the embedding-target theorem to PRC with that expressiveness proof. Both embedding_target and embedding_from_expressive are filled by the same proved theorem (the universal quantifier form). The strength tag is closed by rfl on the delta-only equality.
why it matters
This is the Step 12 closure of the PRC formal-system surface and embedding theorem. Downstream it feeds the first-pass kernel certificate (K7/A2) and, through that kernel, the conditional universal-foundation certificate that assembles kernel, real-complete ordered field, and trace-logic layers.
In the Recognition Science stack this sits under the foundation forcing chain: before J-uniqueness (T5), phi (T6), the eight-tick octave (T7), and D = 3 (T8) can be treated as forced inside a formal calculus, the calculus must exist as an expressive formal system with a stable embedding interface. The certificate deliberately does not hide the next inevitability layer (every external foundation satisfies the interface); that remains a separate claim.
Switch to Lean above to see the machine-checked source, dependencies, and usage graph.