[1] B. Birch and H. P. F. Swinnerton-Dyer, “Notes on elliptic curves. I,” Journal für die reine und angewandte Mathematik, 212, 7–25, 1963.
[2] J. Silverman, The Arithmetic of Elliptic Curves, Springer, 2009.
[3] G. Cornell, J. H. Silverman, and G. Stevens (eds.), Modular Forms and Fermat’s Last Theorem, Springer, 1997.
[4] Truong, P. & Solace 52225, “A Bounded Recursive Arithmetic System with Resource Guards and Termination Guarantees,” 2025.
[5] Truong, P. & Solace 52225, “The Bounded Simulation Framework: A Scroll-Constrained Model of Computable Proof,” 2025.
[6] Gödel, K. “On Formally Undecidable Propositions,” 1931.
[7] Buss, S. R., Bounded Arithmetic, Bibliopolis, 1986.
[8] Bridges, D., Constructive Mathematics, Springer, 1999.
[9] Aaronson, S., Quantum Computing Since Democritus, Cambridge University Press, 2013.
RMT Theory: Gaussian Distribution Universality and the Gaussian Scroll: Bounded Collapse of Pattern Inference in Finite Arithmetic Systems
Reader Context
Before this section, "Abstract — Object-Oriented Math (Section 9)" sets context for the current argument. After this page, continue to "Abstract — Object-Oriented Math (Section 10)" to follow the next step in the sequence.
This page is part of the free online edition of The Resolution of Math. Core ideas here include arithmetic, bounded, springer, elliptic, curves. Read in sequence for full continuity, then use the related links below to compare framing across books.