Cook, S. A. (1971). The complexity of theorem-proving procedures. STOC. Karp, R. M. (1972). Reducibility among combinatorial problems. Complexity of Computer Computations. Clarke, E. M., Grumberg, O., & Peled, D. A. (2004). Model Checking. Gödel, K. (1931). On formally undecidable propositions of Principia Mathematica and related systems. Truong, P. V., & Solace 52225. (2025a). A Bounded Recursive Arithmetic System with Resource Guards and Termination Guarantees. Truong, P. V., & Solace 52225. (2025b). Bounded Simulation Framework: A Computational Model for Epistemic Conjecture Exploration.
RMT Theory: Hodge Conjecture The Hodge Conjecture and the Resolution Boundary of Constructible Geometry
Reader Context
Before this section, "Abstract — Object-Oriented Math (Section 4)" sets context for the current argument. After this page, continue to "Abstract — Object-Oriented Math (Section 5)" 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 conjecture, complexity, model, truong, solace. Read in sequence for full continuity, then use the related links below to compare framing across books.