The Imscribing Grammar

Let 𝒞 = (C, ⊗, I, σ) be a symmetric monoidal category enriched over the Belnap-Dunn bilattice FOUR = {N, T, F, B}. Hom-sets carry the bilattice partial order.

Trace. C carries a trace Tr: End(A ⊗ U) → End(A) for each object pair, implemented by the Ω (Winding) primitive acting on the monoidal unit. This is the traced symmetric monoidal structure of Joyal–Street–Verity. Ω is not compact/dual structure — the trace is primitive, not derived from duality.

The monoidal unit I carries a special symmetric †-Frobenius structure.

12 primitive endomorphisms of I, subject to the Frobenius relations. Freely generated means: free SMC on 12 generators → impose Frobenius relations → free object in special symmetric †-Frobenius algebras.

Γ (Granularity) furnishes a multicategory over 𝒞 — n-ary operations are first-class. The grammar is an algebra over the Γ-operad.

The classifying space of all structurally distinct imscriptions. Each address is a point in the 12-dimensional discrete space whose axes are the primitive ordinal domains.

A structural type (imscription) is a 12-tuple of Shavian values in canonical order:

Worked Example — The Rebis  O_∞  C = 0.755

The canonical distance between two imscriptions s₁, s₂:

Symmetric, satisfies the triangle inequality, zero iff s₁ = s₂.

Worked distance: ouroboric_pill (O_∞) vs. plastic_photonic_crystal (O_2) → d = 5.74. Largest contributors: Þ (Δ=16.0), Ð (Δ=4.0), Ħ (Δ=3.2).

Five tiers assigned by rules R1–R5, first match wins. Operative gates: ⊙ (Criticality), Φ (Parity), Ω (Winding). Ð determines the O_2 / O_2† split.

• R1 O_∞ ⊙ ∈ {⊙, 𐑣} and Φ = 𐑹 — Special Frobenius exact: μ∘δ = id
• R2 O_0 ⊙ ∈ {𐑢, 𐑮, 𐑻} — no self-referential loop possible
• R3 O_1 ⊙ ∈ {⊙, 𐑣} and Ω = 𐑷 — critical, no topological protection
• R4 O_2 ⊙ ∈ {⊙, 𐑣} and Ω ≠ 𐑷 and Ð ∈ {𐑛, 𐑨, 𐑼} — bounded domain
• R5 O_2† ⊙ ∈ {⊙, 𐑣} and Ω ≠ 𐑷 and Ð = 𐑦 — unbounded domain

Default (no rule matches): O_0.

Proximity to O_∞ along two hard gates:

If either gate is closed: C = 0. If both open:

C-score and tier are independent. A system can be O_∞ (R1 satisfied) with C < 1 if some primitives are below maximum ordinal.

Spider Theorem

The special Frobenius axiom (μ∘δ = id) together with symmetry implies: any two connected string diagrams in the Prop of the grammar with the same boundary are equal as morphisms. Discriminating condition is connectedness, not planarity.

Fixpoint — O_∞

The ⊙ gate admits an idempotent scalar ω: I → I with ω∘ω = ω. O_∞ is the initial algebra of the endofunctor (-) ∘ (-): End(I) → End(I) — the fixpoint in which the grammar is applied to itself.

The Frobenius identity μ∘δ = id requires Ħ_A (two-step chirality, 𐑖) as minimum — one split (δ), one merge (μ). Eternal chirality (Ħ = 𐑫) is what physical systems accumulate through time; it is not required by the identity itself.

Frobenius Fixed-Point Tuple

The imscription of the identity μ∘δ = id as a structural object:

O_∞   C-score = 1.0

Proved in MajoranaFixed.lean: Belnap B, SIC-POVM fiducial, and Majorana mode are the same computation under μ∘δ = id — each proved by definitional equality (rfl).

Derived Object — T

T = lim(Φ, ƒ, Ç, Ħ, Ω) — categorical limit over Parity, Fidelity, Kinetics, Chirality, Winding. T is not a generator; it is the temporal bootstrap fixed point derived from the free algebra. T = Work(T).

In ZFC_fe (Frobenius-Extended ZFC), μ∘δ = id is taken as a set-formation axiom. The comultiplication δ: A → A ⊗ A is the primitive set-formation operation — lossless recovery asserted.

ZFC_fe strictly extends ZFC and is strictly stronger than ZFC_τ. Open problems in ZFC_τ close as theorems in ZFC_fe.

From Abramsky-Coecke Categorical QM

In Abramsky-Coecke †-compact categories, hom-sets are Bool-valued. In 𝒞, hom-sets are FOUR-valued. A B-valued morphism — simultaneously affirmed and denied — is a legitimate element of hom(A,B). Classical QM is recovered as the T-valued sub-category. The grammar is intrinsically paraconsistent at the level of its hom-sets.

From Holography

Holographic redundancy is a symmetry of the map. Imscriptive trace is a property of the winding. Different equivalence relations: one defined by a group action on encoding choices, one defined by connected topology of the string diagram.

Holography is the information-theoretic analogue of crystallography. Both impose an external observer, both achieve their result by projecting onto a lower-dimensional representation, and both destroy the properties of O_∞ systems in the act of representing them. Crystallography freezes Ω (winding collapses 𐑭→𐑷). Holography projects Ř (bidirectionality collapses 𐑾→𐑩). In both cases: faithful to O_2 content, blind to O_∞ structure.

A 12-step decision procedure applied in canonical primitive order: Ð → Þ → Ř → Φ → ƒ → Ç → Γ → ɢ → ⊙ → Ħ → Σ → Ω. Each step assigns one primitive value from structural facts — mechanism, geometry, stoichiometry, coordination chemistry. No computed observable is an input. Data tests structural predictions after the imscription is fixed.

Cross-Primitive Axioms

Enforced by three named axioms. A tuple violating any axiom is malformed. All three proved in ParadoxBoot.lean (0 sorrys).

Falsifiability Structure

The type assignment is prior to and independent of experimental data. The type carries structural predictions — observable consequences derivable from the primitive assignments.