There is a newer version of the record available.

Published December 6, 2025 | Version v7
Preprint Open

Universal Self-Reference: An Axiomatic Metatheory

Authors/Creators

Description

Many modern systems, from software stacks and learning architectures to institutions, continually observe themselves and adjust their behavior in response. We develop a lens-relative, axiomatic framework for such self-referential systems with feedback, separating how the world is sampled from how it is updated. For a fixed observer (lens), we work with an effective state space and a two-phase Scan–Reconfigure map (scan, then reconfigure based solely on that scan), whose fixed points describe steady regimes; equipped with envelope–slack structure, these regimes support built-in stability and safety margins. A simple notion of time, together with the information loss in the Scan stage, yields a No Global Two-Sided Rollback theorem: at the effective level no single Scott-continuousoperation can perfectly undo all changes, even though local reversibility can persist inside steady regimes. To track safety budgets we introduce envelopes, or reachable safety regions, and slack variables that separate admissible motion from margin consumption. Under weak assumptions, safety envelopes can only grow and a broad class of natural size measures is nondecreasing along reachable envelopes, so margins can be spent but not spontaneously restored. A mirror construction gives a controlled replay operation at the intermediate stage and links mirror behavior, periodic patterns, and steady regimes. The metatheory is robust under rescaling, changes of observer, and added scaffolding, and it supplies reusable templates for embedding reaction networks, epidemic and regulatory models, horizon toy models, and learning systems.

Files

Universal Self-Reference.pdf

Files (4.0 MB)

Name Size Download all
md5:186adbbe7a6024b48d16aa345927e3e5
426.5 kB Preview Download
md5:b4ee967e246867d2845817c607e2daae
3.6 MB Preview Download

Additional details

References

  • A. Tarski. A lattice-theoretical fixpoint theorem and its applications. Pacific Journal of Mathematics 5(2):285–309, 1955. doi:10.2140/pjm.1955.5.285.
  • G. Markowsky. Chain-complete posets and directed sets with applications. Algebra Universalis 6:53–68, 1976.
  • D.S.Scott.Continuouslattices.InToposes,AlgebraicGeometryandLogic,LectureNotesinMathematics, vol. 274, pp. 97–136. Springer, 1972. doi:10.1007/BFb0073967.
  • G. Gierz, K. H. Hofmann, K. Keimel, J. D. Lawson, M. Mislove, and D. S. Scott. Continuous Lattices and Domains. Encyclopedia of Mathematics and its Applications, vol. 93. Cambridge University Press, 2003. doi:10.1017/CBO9780511542725.
  • S. Abramsky and A. Jung. Domain theory. In Handbook of Logic in Computer Science, vol. 3, pp. 1–168. Oxford University Press, 1994.
  • S. Mac Lane. Categories for the Working Mathematician (2nd ed.). Graduate Texts in Mathematics, vol. 5. Springer, 1998. doi:10.1007/978-1-4757-4721-8.
  • P. J. Freyd and A. Scedrov. Categories, Allegories. North-Holland Mathematical Library, vol. 39. Elsevier, 1990.
  • B. Jacobs. Categorical Logic and Type Theory. Studies in Logic and the Foundations of Mathematics, vol. 141. Elsevier, 1999.
  • M. Riley. Categories of optics. arXiv:1809.00738, 2018. doi:10.48550/arXiv.1809.00738.
  • D. Kozen. Results on the propositional 𝜇-calculus. Theoretical Computer Science 27:333–354, 1983. doi:10.1016/0304-3975(82)90125-6.
  • J. Bradfield and C. Stirling. Modal 𝜇-calculi. In P. Blackburn, J. van Benthem, and F. Wolter (eds.), Handbook of Modal Logic (Studies in Logic and Practical Reasoning, vol. 3), pp. 721–756. Elsevier, 2007. doi:10.1016/S1570-2464(07)80015-2.
  • A. Joyal, R. Street, and D. Verity. Traced monoidal categories. Mathematical Proceedings of the Cambridge Philosophical Society 119(3):447–468, 1996. doi:10.1017/S0305004100074338.
  • P. Selinger. Dagger compact closed categories and completely positive maps. Electronic Notes in Theoretical Computer Science 170:139–163, 2007. doi:10.1016/j.entcs.2006.12.018.
  • L. P. Kadanoff. Scaling laws for Ising models near 𝑇𝑐. Physics Physique Fizika 2(6):263–272, 1966. doi:10.1103/PhysicsPhysiqueFizika.2.263.
  • K. G. Wilson. The renormalization group: Critical phenomena and the Kondo problem. Reviews of Modern Physics 47:773–840, 1975. doi:10.1103/RevModPhys.47.773.
  • W. H. Zurek. Decoherence, einselection, and the quantum origins of the classical. Reviews of Modern Physics 75(3):715–775, 2003. doi:10.1103/RevModPhys.75.715.
  • F. W. Lawvere. Diagonal arguments and cartesian closed categories. In Category Theory, Homology Theory and their Applications II, Lecture Notes in Mathematics, vol. 92, pp. 134–145. Springer, 1969. doi:10.1007/BFb0080769.
  • D. Harlow. Jerusalem lectures on black holes and quantum information. Reviews of Modern Physics 88:015002, 2016. doi:10.1103/RevModPhys.88.015002.
  • S. C. Kleene. Introduction to Metamathematics. North-Holland, 1952.
  • B. A. Davey and H. A. Priestley. Introduction to Lattices and Order (2nd ed.). Cambridge University Press, 2002. doi:10.1017/CBO9780511809088.
  • F. Borceux. Handbook of Categorical Algebra 2: Categories and Structures. Encyclopedia of Mathemat ics and its Applications, vol. 51. Cambridge University Press, 1994. doi:10.1017/CBO9780511525865.
  • P. T. Johnstone. Sketches of an Elephant: A Topos Theory Compendium. Oxford Logic Guides, vols. 43–44. Oxford University Press, 2002.
  • M. Shulman. Framed bicategories and monoidal fibrations. Theory and Applications of Categories 20:650–738, 2008.
  • K. Gödel. Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I. Monatshefte für Mathematik und Physik 38:173–198, 1931. doi:10.1007/BF01700692.
  • A. M. Turing. Computing machinery and intelligence. Mind 59(236):433–460, 1950. doi:10.1093/mind/LIX.236.433.
  • I. Goodfellow, Y. Bengio, and A. Courville. Deep Learning. MIT Press, Cambridge, MA, 2016. deeplearningbook.org.
  • R.S.SuttonandA.G.Barto.Reinforcement Learning: An Introduction (2nd ed.). MIT Press, Cambridge, MA, 2018.
  • D. Amodei, C. Olah, J. Steinhardt, P. Christiano, J. Schulman, and D. Mané. Concrete problems in AI safety. arXiv preprint arXiv:1606.06565, 2016. doi:10.48550/arXiv.1606.06565.
  • M. Feinberg. Chemical reaction network structure and the stability of complex isothermal reactors. Archive for Rational Mechanics and Analysis 49(3):187–194, 1972.
  • J. Gunawardena. Chemical reaction network theory for in-silico biologists. Technical report, Harvard University, 2003.
  • M. Yuan. Ricci Flow and the Omega-Frame: A Lens-Relative Reading of Perelman's Approach to the Poincaré Conjecture. Preprint, 2025. Archived at Zenodo, DOI 10.5281/zenodo.17764230.