Syntactic Token Calculus (STC) The formal system developed in this monograph, built from two primitives—the mark and the enclosure—and two reduction rules (Calling, Crossing). It provides a syntactic foundation for physics.
Laws of Form George Spencer‑Brown’s calculus of distinctions, published in 1969. The STC adopts its primitives and rules without modification.
Mark (#) The primitive act of drawing a distinction. Represented typographically as #. In the STC, the mark serves as the point at infinity on the projective line.
Enclosure ([ ]) The act of drawing a boundary that separates an inside from an outside. Syntactically, a pair of square brackets containing an expression.
Calling The reduction rule ## → # (idempotence). Interpreted as condensation of redundant states.
Crossing The reduction rule [[A]] → A for any expression $A$ (involution). Interpreted as cancellation of a double boundary.
Normal form An expression that contains no substring ## and no substring [[A]]. Normal forms are irreducible and correspond to stable physical particles.
Complexity The total number of marks plus bracket pairs in an expression. Used to measure syntactic simplicity.
Bruhat‑Tits tree ($T_p$) An infinite, regular tree where each vertex has degree $p+1$ (for a prime $p$). Serves as the universal state space in the STC. The tree is ultrametric and self‑similar.
p‑adic numbers ($\mathbb{Q}_p$) A completion of the rational numbers using the p‑adic absolute value. Form an ultrametric space that underlies the Bruhat‑Tits tree.
p‑adic absolute value ($|x|p$) For a rational number $x = p^n (a/b)$ with $p \nmid a,b$, defined as $|x|p = p^{-n}$. Satisfies the strong triangle inequality.
Ultrametric space A metric space where distances satisfy the strong triangle inequality: $d(x,z) \le \max(d(x,y), d(y,z))$. In such a space, all triangles are isosceles and small perturbations cannot accumulate.
Monna map ($Mp$) A function $Mp: \mathbb{Q}_p \to \mathbb{R}$ that “flips” the p‑adic expansion, turning $p^k$ into $p^{-k}$. It projects the discrete tree onto the continuous real numbers, providing the coarse‑graining that yields classical spacetime.
Discrete scale invariance Invariance under rescaling by a fixed factor $q$. Leads to log‑periodic oscillations in observables.
Log‑periodic oscillations Oscillations that are periodic in the logarithm of the scale. Signature of discrete scale invariance. Predicted in the CMB power spectrum and particle‑mass ratios.
Cross‑ratio ($\chi(A,B,C,D)$) A projective invariant of four points. In the STC, defined as the normal form of [ [ A B ] [ C D ] ]. Mass, charge, and spin are special cases.
Projective line ($\mathbb{P}^1$) The set of lines through the origin in a two‑dimensional vector space. In the STC, syntactic patterns correspond to points on $\mathbb{P}^1(\mathbb{Q}_p)$.
Photon The pattern [#]. The simplest boson; massless, spin‑1, charge‑0.
Electron The pattern [# [#]]. A first‑generation fermion; charge −1, spin‑½.
Up quark The pattern [[#] #]. A first‑generation quark; charge +²/₃, spin‑½.
Down quark The pattern [[#] [#] #]. A first‑generation quark; charge −¹/₃, spin‑½.
W boson The pattern [[#] [#]]. A weak gauge boson; charged, spin‑1.
Z boson The pattern [[#] [#] [#]]. A neutral weak gauge boson; spin‑1. Shares pattern with the Higgs.
Higgs boson The pattern [[#] [#] [#]]. A scalar particle; spin‑0. Degenerate with the Z boson in the STC.
Mass pattern ($\mathcal{M}(P)$) The cross‑ratio $\chi(P,\#,\text{blank},\#)$. Determines the particle’s mass.
Charge pattern ($\mathcal{Q}(P)$) The cross‑ratio $\chi(P,[\#],\#,\#)$. Determines the electric charge.
Spin pattern ($\mathcal{S}(P)$) The cross‑ratio $\chi(P,P,\text{blank},\#)$. Determines the spin statistics.
Isospin symmetry The equivalence of up‑ and down‑quark spin patterns under projective transformations.
Pauli exclusion The impossibility of merging two identical fermion patterns; arises from syntactic clash.
Spin‑statistics theorem The syntactic theorem that symmetric patterns (bosons) have identical charge and spin patterns, while asymmetric patterns (fermions) have distinct ones.
Z/Higgs degeneracy The sharing of the same syntactic pattern [[#] [#] [#]] by the Z boson and Higgs boson. An unresolved issue in the STC.
Excited Higgs resonances Predicted heavier scalars with patterns [[#] [#] [#] [#]], [[#] [#] [#] [#] [#]], etc., at geometric mass intervals.
CMB (Cosmic Microwave Background) The relic radiation from the early universe. Its temperature is exactly the Hawking‑Hubble temperature.
Hawking‑Hubble temperature ($T{HH}$) The temperature of the Hubble sphere treated as a black‑hole horizon: $T{HH} = \hbar H0/(2\pi kB) \approx 2.725\ \text{K}$. Matches the observed CMB temperature.
Planck temperature ($TP$) The temperature corresponding to the Planck energy: $TP = EP/kB \approx 1.4\times10^{32}\ \text{K}$.
Geometric‑mean formula Haug & Tatum’s proposal $T{\text{CMB}} = \sqrt{TP T_{HH}}$, reinterpreted in the STC as a projective cross‑ratio on a logarithmic scale.
$Rh = ct$ universe A cosmological model where the Hubble radius grows linearly with cosmic time: $Rh = c t$. Provides a zero‑order approximation to the STC’s discrete cosmology.
Acoustic peaks Oscillations in the CMB power spectrum due to sound waves in the early plasma. Periodic in $\ell$, not in $\ln\ell$; distinguishable from log‑periodic signals.
Silk damping The damping of small‑scale CMB fluctuations due to photon diffusion.
Passive geometric fault tolerance The intrinsic error suppression provided by the ultrametric geometry of the Bruhat‑Tits tree. Small perturbations cannot accumulate; logical errors require crossing discrete energy barriers.
Active error correction The conventional approach to fault‑tolerant quantum computation, using redundant encoding and continuous measurement (e.g., surface codes). Contrasts with passive protection.
Thermodynamic wall The limit on the size of a quantum computer imposed by the heat dissipated by active error correction. Passive fault tolerance circumvents this wall.
Non‑Archimedean quantum gates Discrete isometries on the Bruhat‑Tits tree that manipulate quantum states without analog over‑rotation errors.
Over‑rotation error An error in conventional quantum gates where a pulse rotates the state by an incorrect angle. Eliminated in non‑Archimedean gates.
Ultrametric clustering The organization of data into hierarchical clusters that satisfy the strong triangle inequality. Predicted for neural representations.
Cocycle solver A system that maintains global consistency by solving local constraints. The brain is hypothesized to be a cocycle solver.
Substantivalism The view that reality consists of substances (particles, fields, spacetime) that exist independently. Contrasts with relationalism.
Relationalism The view that reality consists of relations, not substances. The STC is a relational theory: particles are patterns of distinctions.
Epistemic time Time as experienced by an observer, arising from the traversal of the static tree. Contrasts with ontic time.
Ontic time Time as a fundamental dimension of reality. The STC eliminates ontic time; the tree is static.
Macro‑ledger ($L$) The rest of the universe, represented by … in syntactic expressions. Encodes the computationally irreducible history of a particle.
Distributive law The syntactic identity [ [ A L ] [ B L ] ] → [ [ A B ] ] L. Proof of locality: the ledger factors out of local interactions.
Syntactic Reality Engine (SRE) The software toolkit for exploring the STC. Implements reduction, cross‑ratio calculation, and ultrametric analysis.
UltraCluster library Software for detecting ultrametricity in data. Part of the SRE.
Quantitative bridge problem The unsolved problem of mapping syntactic cross‑ratios to numerical masses in MeV. Requires calibration via the Monna map.