← The Resolution of Math

References — Object-Oriented Math (Section 2)

Chapter 42 of The Resolution of Math

The Resolution of Math cover

Lagarias, J. C. (1985). The 3x+1 problem and its generalizations. American Mathematical Monthly Tao, T. (2019). Almost All Collatz Orbits Attain Almost Bounded Values. arXiv:1909.03562 Gödel, K. (1931). On Formally Undecidable Propositions of Principia Mathematica and Related Systems Truong, P. V., & Solace 52225. (2025). A Bounded Recursive Arithmetic System with Resource Guards and Termination Guarantees. Preprint Truong, P. V., & Solace 52225. (2025). Bounded Simulation Framework for Conjecture Exploration. Preprint

RMT Theory: Goldbach Conjecture Goldbach Revisited: A Bounded Simulation Approach to Even Number Partitioning

Reader Context

Before this section, "Abstract — Object-Oriented Math (Section 2)" sets context for the current argument. After this page, continue to "Abstract — Object-Oriented Math (Section 3)" 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 bounded, almost, truong, solace, 52225. Read in sequence for full continuity, then use the related links below to compare framing across books.

Buy on Amazon Browse all books Read essays