Generative Structural Theory v1.9: Finite Simulation Rank, Tightness and Certificate Inheritance
Abstract
GST v1.9 does not prove that d(n) is unbounded. That sentence is the paper's own, and the rest of this description says what is proved instead and what the question has been reduced to. We study the rank of a finite simulation game on cut chains: die(X,Y) is the number of approximant rounds a pair survives, and d(n) its maximum at ambient size n. PROVED, for arbitrary fixed n: a recursion for die and its forall-exists form; two size bounds, die(X,Y)
Fields of Study & Subjects
Game Theory and Applications
Opinion Dynamics and Social Influence
Game Theory and Voting Systems
Publication details
- Journal / source
- Zenodo (CERN European Organization for Nuclear Research)
- Publication date
- 11 September 2026
- Language
- EN
- Document type
- Preprint