Syntactic Token Calculus: Deriving Particle‑like Normal Forms from Distinction Operations

In the paper's words

Contemporary high‑energy physics relies on continuous fields and numerous unobservable entities, incurring substantial theoretical and experimental costs. A gap exists in providing a minimal discrete substrate that can generate particle‑like structures without presupposing fields. We introduce the Syntactic Token Calculus (STC), a two‑primitive formal system built from a mark # and nested enclosures [ ].

The abstract, verbatim; every line below is quoted from the text.

What it claims

that stable normal forms of STC correspond to elementary particles—would be falsified if any of the following observations were made:

Numbers it reports

1. Assuming a modest workstation (CPU $\approx$ 3 GHz, 16 GB RAM), the enumeration and reduction for $n=6$ are projected to complete in under 5 seconds and consume <100 MB of memory.

   from 7.5 Projected Cost and Performance Bounds

2. Using the multilingual parsing benchmark ([2]) we compute an average parsing score of 78.7 % .

   from Abstract

3. Derivation of a concrete benchmark: the average multilingual parsing score (MSLAS) across nine languages equals 78.7 % (Section 4).

   from 1. Introduction

4. The reported scores (e.g., Czech = 87.1 %, Turkish = 58.7 %) and the training hyper‑parameters (learning rate $2\times10^{-5}$, batch size = 16) illustrate how discrete token structures can be evaluated quantitatively ([2], § 3).

   from 2. Background and Related Work

5. The multilingual parsing benchmark ([2]) reports the following MSLAS scores (percentage) for nine languages: Language MSLAS Czech 87.1 English 83.8 Hebrew 68.7 Italian 73.0 Polish 75.0 Portuguese 88.9 Serbian 86.6 Swedish 86.6 Turkish 58.7 Step 1: Sum the nine percentages. $$ \begin{aligned} S &= 87.1 + 83.8 + 68.7 + 73.0 + 75.0 \\ &\quad + 88.9 + 86.6 + 86.6 + 58.7 \\ &= 708.4 . \end{aligned} $$ Step 2: Divide by the number of languages $N=9$ to obtain the average. $$ \text{Average MSLAS} = \frac{S}{N} = \frac{708.4}{9} = 78.711\ldots . $$ Rounded to one decimal place, the average is 78.7 % , matching the reported overall average in the source ([2], § 4.1).

   from 4.1 Benchmark from Multilingual Parsing Scores

6. The average multilingual parsing score across nine languages is 78.7 % (Section 4.1).

   from 5. Results

How it is done

1. We define precise reduction rules, prove confluence and termination, and enumerate irreducible normal forms up to nesting depth 5.

   from Abstract

2. Definition of the STC reduction system and proof of confluence and termination (Section 3).

   from 1. Introduction

3. The three properties of the NbE algorithm (preservation of equivalence, embedding, and inversion) serve as a template for our own normalization proof.

   from 2. Background and Related Work

4. We define a deterministic, locally confluent rewrite system $\rightarrow$ on tokens: Crossing (annihilation). $$[\,\#\,] \;\rightarrow\; \varepsilon$$ where $\varepsilon$ denotes the empty token.

   from 3.2 Reduction Rules

What would falsify it

1. The main claim—that stable normal forms of STC correspond to elementary particles—would be falsified if any of the following observations were made: Empirical particle spectra (including generations and mixing angles) cannot be mapped injectively onto the set of normal forms up to a reasonable depth (e.g., $n\le6$).

   from 6.2 Falsifiability

2. This framework incurs substantial theoretical overhead and hampers falsifiability, as highlighted in a comparative diagnostic of modern theories ([7]).

   from 1. Introduction

3. Discussion of limitations, falsifiability criteria, and a roadmap for the smallest experimental validation (Section 6).

   from 1. Introduction

Where the claim stops

1. Assumption Sensitivity Reduction rules are limited to the four primitives defined in Section 3.2.

   from 6.1 Limitations

2. Noise model assumes independent Poisson events per vertex.

   from 6.1 Limitations

3. Future work will extend the rule set, explore categorical semantics, and construct experimental prototypes to test the falsifiable predictions enumerated herein.

   from 8. Conclusion

Where to read

1. Abstract157 words · 1 min
2. 1. Introduction271 words · 1 min
3. 2. Background and Related Work451 words · 2 min
4. 3. Methods469 words · 2 min
5. 4. Analysis320 words · 1 min
6. 5. Results99 words · 1 min
7. 6. Discussion215 words · 1 min
8. 7. Practical Implications and Engineering Pathways332 words · 1 min
9. 8. Conclusion137 words · 1 min
10. Provenance and AI Involvement225 words · 1 min
11. Appendix A. Divergence report87 words · 1 min
12. Appendix B. Claim attribution88 words · 1 min