⊙ · · · ⊙ · · · ⊙

The Necessity of the Grammar

What forces it  ·  What evidences it  ·  Why nothing extends it

⊢ ⊣ > < ⋈ ⊤ ∈ ∋ ⊙ ⊥ ⊞ ◻

The Imscribing Grammar is not one description among many. It is the terminal one — and this page gives the reason, with every structural claim followed by the statement that carries it and the axioms that statement depends on. The last section grades what is not carried, because a synthesis that reports only its wins is an advertisement.

§1   Closure, not consistency

A description of a system that contains the describer cannot be judged by consistency alone. Consistency is a property of a line: a sequence of inferences that never doubles back. Gödel's result is the price of insisting on lines — a system strong enough to describe itself has true sentences its own line cannot reach.

The alternative criterion is closure. Write δ for the operation that splits an object into a distinguished pair, and μ for the operation that fuses a pair back.

μ ∘ δ = id over a transformed object

That last clause is the whole content. If the object were unchanged the condition would be a triviality — a cycle, an identity. Because the object is transformed, the condition says something strong: the split and the fusion together return the system, having moved it. A loop that returns changed is autopoiesis; a line that never returns is incompleteness. There are no lines here, only loops.

Carried by frobenius_mu_delta_id for four-valued words of any length, mu_delta_id_vessel for vessel coordinates, mu_delta_id_on_entry for catalog entries — the same condition in three registers.

§2   Distinction forces four values

The naive reading of a distinction is that it yields two values — marked and unmarked, true and false. It does not, and the reason is that the act of marking is itself either present or absent, independently of what it marks. Cross the two independent facts and four values appear.

complement
not asserted
complement
asserted
mark
not asserted
Nneither
Ffalse
mark
asserted
Ttrue
Bboth

the shaded pair are created by the distinction, not selected by it

N is the necessary unmarked complement: not an absence bolted on for symmetry, but the value co-created by the act of distinguishing. You cannot draw a distinction without simultaneously creating the region it does not reach. B is where both are asserted at once — not an error state but a value, and the reason the logic is paraconsistent rather than broken.

Negation is an involution on all four, but it moves T and F while fixing B and N. The two values negation cannot move are exactly the two the distinction created rather than selected.

The sharper signature Order the values by truth — F below N and B, both below T, with N and B incomparable — and the created pair turn out to be each other's complement: N ∧ B = F and N ∨ B = T, with nothing else complementing either. So the four values carry two involutions on the created pair, and they are different maps. The lattice complement exchanges N and B. The negation fixes both. A value whose complement is not its negation is a value that cannot be argued away — which is what B is.
Carried by bnot_fixpoint_iff — negation fixes a value if and only if it is B or N. B_complement_iff — B's complement is exactly N, as an equivalence. complement_ne_negation — the two involutions side by side. Each on propext alone. The biological complement, by contrast, is fixed-point free and never coincides with the negation.

§3   Self-application closes at four

Having four values, ask what it costs to describe them with themselves. The description of a four-valued system by four-valued means has 4² = 16 cells. The power set of four values also has 2⁴ = 16 members.

n2ⁿcoincide
244yes — degenerate
389no
41616yes
53225no
66436no — and never again

At n = 2 the coincidence is degenerate. At n = 4 it is not, and it is exactly what licenses reading the sixteen as four applied to itself rather than as a new sixteen-valued level demanding its own description. The level of self-description is not a new level. This is the first appearance of terminality, and it is arithmetic rather than doctrine: at three or five the identity fails and the tower would have to keep climbing.

§4   Twelve axes, and an alphabet that partitions

The twelve axes enumerate the independent ways a distinction can be made. Their value counts come from the kernel's constructor declarations, which are the authority — not from prose, and not from usage.

valuesaxescount
3Fidelity, Granularity, Stoichiometry3 axes
4Dimensionality, Relational, Grammar, Chirality, Protection5 axes
5Topology, Polarity, Criticality, Kinetics4 axes
17,280,000

3³ × 4⁵ × 5⁴  ·  the Crystal of Types  ·  a complete enumeration, not a sample

Two facts about the alphabet, both recomputed from the kernel's constructors and the flat catalog rather than quoted, and both load-bearing. The value glyphs number exactly 49 — 4+5+4+5+3+5+3+4+5+4+3+4. And the twelve value sets are pairwise disjoint: no glyph serves two axes.

Disjointness is not bookkeeping. It is why an imscription can be written as twelve adjacent glyphs with no separators, no slot labels and no delimiters, and still parse uniquely: each glyph names its own axis. The ligature is the structural binding, and it can be, because the alphabet partitions. A notation that needed separators would be admitting its symbols do not know where they belong.

§5   No interpretation layer

Put the last two sections together. The type space is complete — every combination of values is a type, all 17,280,000 of them — and the alphabet partitions, so every written word is a type and every type has exactly one word.

The consequence is that there is nothing between a system and its type. When two systems from different registers carry the same imscription, that is not an analogy drawn by an observer, nor a signature of some third underlying substance both “really” are. It is a structural fact of the same kind as two integers being equal. Co-typing has no interpretation layer beneath it because there is no room for one: the type space is not a model of anything, it is the enumeration of what distinctions are available.

This is why the vocabulary is literal. Organism means organism; catalysis means catalysis. A chain of reasoning that is literal for eight steps and figurative on the ninth has smuggled back in the interpretation layer that completeness forbids.

§6   The registers compose isomorphically

That claim is checkable, because registers that share structure must share counts, and counts are not negotiable.

registerstructurecount
Geneticsnucleotides ↔ the four values, bijectively4
codons as triples4³ = 64
ground-layer amino acids8
promoted amino acids, one per axis12
Crystal fibered over codons, no remainder270,000 × 64
Measurementmultilattice orbit at d = 2ⁿ4ⁿ = d²
fiducial overlap, every group elementconstant

In the quantum register the four-valued multilattice carries the full symmetric informationally complete structure unconditionally at every dimension d = 2ⁿ: the orbit has d² states, the fiducial is equiangular against every group element, and the closure condition holds on every word. No Stark unit, no ray class field, no embedding into ℂd is used or needed.

The relationship between the two registers is not that biology is like measurement. It is that the same closure condition, on the same four values, enumerated over the same twelve axes, is what both are made of. One voice.

Carried by nucToB4_bijective, codon_card, ground_layer_card, promoted_card, ground_promoted_disjoint and ground_promoted_cover for the partition, crystal_fiber and fiber_times_codons for the fibration. The axis bijection is primitive_bijection — each axis carried by exactly one promoted amino acid, proved for every axis. The quantum register is sic_povm_belnap_unconditional: nine conjuncts on propext, Classical.choice, Quot.sound and nothing else.

§7   How a claim resolves

The practical content of a terminal grammar is that it sorts. Any claim — about a molecule, a proof, a market, a manuscript — lands in exactly one of three places, and the Grammar says which by inspecting the claim's own type rather than by consulting the claimant.

1   A recorded computation

The claim is a value that was computed and written down. It discharges to a definition and a proof by reflexivity; nothing is assumed. A claim of this kind carried as an assumption is a defect, and a visible one: an opaque constant beside a second assertion giving its value is a value pretending to be a hypothesis.

2   A theorem of the literature

Established mathematics not yet formalized. It is named, stated in full, and assumed — one legible gap with a citation attached. What is forbidden is assuming it without its statement: an assumption of True carrying a famous name is a gap that cannot be audited, because it never says what is missing.

3   An actual claim

Neither computed nor established. It closes through its own development or it does not close. The Grammar's contribution is not a proof but a tier: what kind of closure the claim needs — which is why tiers are derived from the tuple by a decision procedure rather than assigned by hand.

The sorting, applied to the kernel itself The assumption count fell from 435 to 352, but the number is the least interesting part. What changed is that the residue is sorted by kind: what remains assumed either states a theorem of the literature with its name, or states a claim awaiting a development that has been identified. Assumptions asserting True — a name with no content, unauditable by construction — went from twenty-six to twelve, and each of the twelve has a named prerequisite.

Two findings from that pass are what the sorting is for. A structure demanding equiangularity of the zero vector against itself was uninhabitable, so any claim of its existence would have been a claim of falsehood — and it had never been compiled, so nothing had ever objected. And a taxonomy of barriers asserted the seven Millennium conjectures outright, which would have handed the prize problems to everything downstream; it too had never been compiled. Both were found by the same move: requiring that every claim state what it claims.

§8   Terminality

Suppose an extension: some aspect of some system the twelve axes cannot type. To propose it at all is to distinguish it — from what the Grammar already types, and from what it does not. But a distinction is precisely what the four values enumerate, and the axes enumerate the independent ways a distinction can be made. The proposal is already typed. It is a value.

The only escape is an aspect that cannot be distinguished at all, indiscernible from everything, unmarkable in principle. That is not outside the Grammar either. It is N, which the first distinction created and which has been a value since the beginning.

The force here comes from the completeness of the type space rather than from any claim of empirical adequacy. A framework laid over the world can always meet something it did not anticipate, because the world was not consulted when the framework was drawn. An enumeration of the available distinctions cannot, because meeting something new is a distinction.

This is also why the Grammar is a source rather than a summary. A summary is downstream of what it summarizes and can be checked against it. The Grammar is upstream: the registers are its images, science is one of its instruments, and an identification it makes — a recurring constant given a structural reading — is a true name gained rather than a mystery dissolved.

§9   What is not carried

The claims above are graded, and this is the grading.

standingwhatextent
kernel only The four-value structure and its two involutions, with the lattice laws that fix the operation tables — commutativity, associativity, idempotence, absorption, De Morgan, distributivity, bounds; codon and amino-acid counts and the Crystal fibration; the multilattice measurement structure; tier assignments as decision procedures. The counts in §4 agree exactly with the kernel's constructors. the spine
compiler trusted Decision procedures run through the compiled evaluator rather than kernel reduction, trusting the compiler as well as the kernel. Where avoidable it should not be paid — the genetics anchors ran this way until converted, as did the SIC moduli results at d = 16, 20 and 2048, five of which now depend on no axioms at all. Where it is not avoidable is exact: the kernel cannot decide an equation between rationals, not even (2 : ℚ) × 3 = 6, because rational normalisation runs through a well-founded gcd that does not reduce. ~1,495 sites
204 files
58 over ℚ
assumed, stated Theorems of the literature carried as named assumptions — Baker–Harman–Pintz, Cramér 1920, Helfgott, Chen, the Yang–Mills continuum limit. Each says what it assumes. named
assumed, unstated Assumptions still standing at True: two await an L-function the library does not have, four a bidegree-indexed cohomology, four extensions of a scaffold's own vocabulary, two a reading. None is load-bearing for this argument. 12
unfilled proof Declarations resting on an unfilled proof. Every module holding one is a leaf that nothing imports, so none propagates — established by walking the import graph. The single exception that did propagate has been closed by proving the construction it depended on. 108
settled Four files declared the four values and disagreed about conjunction at the one pair the truth order leaves incomparable. The algebra decided it without a vote: one table failed absorption, so its operations were not a meet and join of any order; the other failed De Morgan, so its negation did not dualise them. Both vanish at N ∧ B = F, N ∨ B = T. The copies are now proved isomorphic and the laws are theorems, so the cell cannot drift again without a proof failing. 1 cell
4 files
catalog Entries carrying a recorded deviation: two incomplete, thirty using a value outside their axis, tracked by the catalog's own validator. Errors in entries, not in the type space. 32 of 8,161
On d = 12 the distinction is worth keeping sharp: the fiducial is exact — an explicit element of a 2048-dimensional ℚ-algebra over the totally-real moduli field — and both SIC conditions are proved there as ring identities, all 143 overlap identities among them, with no approximation and no root isolation anywhere in them. The compiler question is about who checks the arithmetic inside those identities, not about whether the object is known.

§10   The claim, stated once

Distinction yields four values, of which two are created rather than selected. Four is the unique non-degenerate size at which self-application does not open a new level. Over those values, twelve independent axes enumerate the ways a distinction can be made; their value glyphs partition a 49-symbol alphabet; their product is a complete space of 17,280,000 types with no interpretation layer beneath it. Closure — μ ∘ δ = id over a transformed object — is the criterion those types answer to, and it is the criterion under which registers as far apart as the genetic code and symmetric informationally complete measurement turn out to be the same structure surfacing, with matching counts, checked.

Terminality Anything proposed as outside this is a distinction, and therefore inside it. That is what makes the Grammar terminal, and why it is a source rather than a description: not because it has explained everything, but because there is no place to stand from which to say something it cannot type.

References

1Belnap, N. D. (1977). A useful four-valued logic. In Modern Uses of Multiple-Valued Logic, 5–37.
2Priest, G. (2008). An Introduction to Non-Classical Logic, 2nd ed. Cambridge University Press.
3Gödel, K. (1931). Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I. Monatshefte für Mathematik und Physik 38, 173–198.
4Zauner, G. (1999). Quantendesigns: Grundzüge einer nichtkommutativen Designtheorie. Dissertation, Universität Wien.
5Renes, J. M., Blume-Kohout, R., Scott, A. J., Caves, C. M. (2004). Symmetric informationally complete quantum measurements. Journal of Mathematical Physics 45, 2171–2180.
6Crick, F. H. C. (1968). The origin of the genetic code. Journal of Molecular Biology 38, 367–379.
7Larson, H. T. (1961). Proceedings of the IRE.
μ ∘ δ = id