Submitted:
22 June 2026
Posted:
23 June 2026
You are already at the latest version
Abstract
Keywords:
MSC: 03A05; 03E70; 03E55; 03E65; 03C62
1. Introduction
2. Toward an Absolute Infinite
2.1. Class Ordinals and Class Cardinals
- is a transitive set.
- (, ∈) is a well-ordering.
- C is a transitive class.
- (C, ∈) is a well-ordering.
2.2. The Absolute Infinite: Axiom, Meta-Theory, Definition, and Theorems
Axiom of Maximal Cardinality (AMC): There exists a class cardinal that is greater than any set cardinal in any theory T that can be consistently extended to a class theory proving the existence of .
Definition: A theory is Ω-consistent iff it can be consistently extended to a class theory proving the existence of .
- There exists a theory that is -consistent.
- AMC is not self-referentially inconsistent.
- is a maximal cardinality.
3. Proving the Theorems
4. Further Objections
4.1. Succumbs to the Burali-Forti Paradox
4.2. Is Smaller Than
4.3. Should Not Occur Twice in AMC
4.4. Comes in Many Varieties
5. Conclusions
Funding
Data Availability Statement
Acknowledgments
Conflicts of Interest
Abbreviations
| AMC | The axiom of maximal cardinality |
| CH | The Continuum Hypothesis |
| NBG | von Neumann–Bernays–Gödel set theory |
| Ord | The class of all set ordinals |
References
- Barwise, J. (1967). Infinitary Logic and Admissible Sets. Ph.D. Thesis, Stanford University.
- Blondé, W. (2024). Proving predeterminism, or why actuality is certainly actual. Symposion, 11(2), 141-158. [CrossRef]
- Blondé, W. (2025). God as absolute machine: aligning modern formalisms to prove God. Forum Philosophicum, 30(2), 65-86. [CrossRef]
- Brauer, E., Linnebo, Ø., & Shapiro, S. (2022). Divergent potentialism: a modal analysis with an application to choice sequences. Philosophia Mathematica, 30(2), 143-172. [CrossRef]
- Burali-Forti, C. (1897). Una questione sui numeri transfiniti. Rendiconti del Circolo Matematico di Palermo (1884-1940), 11(1), 154-164. [CrossRef]
- Burgin, M. (2017). Inaccessible Information and the Mathematical theory of Oracles. In Information Studies and the Quest for Transdisciplinarity: Unity through Diversity, 59-114. [CrossRef]
- Cantor, G. (1962). Gesammelte Abhandlungen, ed. E. Zermelo, Hildesheim: Georg Olms Verlagsbuchhandlung, 443–447. [CrossRef]
- Gödel, K. (1931). Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I. Monatshefte für Mathematik und Physik, 38, 173-198. [CrossRef]
- Gorbow, P. K., & Leigh, G. E. (2022). The Copernican Multiverse of Sets. The Review of Symbolic Logic, 15(4), 1033-1069. [CrossRef]
- Gutschmidt, R., & Carl, M. (2024). The negative theology of absolute infinity: Cantor, mathematics, and humility. International Journal for Philosophy of Religion, 1-24. [CrossRef]
- Hamkins, J. D., & Lewis, A. (2000). Infinite time Turing machines. The Journal of Symbolic Logic, 65(2), 567-604. [CrossRef]
- Hamkins, J. D. (2012). The set-theoretic multiverse. The Review of Symbolic Logic, 5(3), 416-449. [CrossRef]
- Hellman, G., & Shapiro, S. (2018). Mathematical structuralism. Cambridge University Press. [CrossRef]
- Heylen, J. (2020). Factive knowability and the problem of possible omniscience. Philosophical Studies, 177, 65-87. [CrossRef]
- Karp, C. (1964). Languages with Expressions of Infinite Length. Amsterdam: North-Holland.
- Koepke, P. (2005). Turing computations on ordinals. Bulletin of Symbolic Logic, 11(3), 377-397. [CrossRef]
- Kunen, K. (1980). Set theory Elsevier.
- Lewis, D. K. (1986). On the plurality of worlds. Oxford: Blackwell.
- Linnebo, Ø. (2013). The potential hierarchy of sets. The Review of Symbolic Logic, 6(2), 205-228. [CrossRef]
- Linnebo, Ø., & Shapiro, S. (2019). Actual and potential infinity. Noûs, 53(1), 160-191. [CrossRef]
- Livadas, S. (2020). Why is Cantor’s Absolute Inherently Inaccessible? Axiomathes, 30(5), 549-576. [CrossRef]
- Meadows, T. (2021). Two arguments against the generic multiverse. The Review of Symbolic Logic, 14(2), 347-379. [CrossRef]
- Parsons, C. (1983), Mathematics in philosophy, Ithaca, New York, Cornell University Press.
- Putnam, H. (1967). Mathematics without foundations. The Journal of Philosophy, 64(1), 5-22. [CrossRef]
- Scambler, C. (2020). An indeterminate universe of sets. Synthese, 197(2), 545-573. [CrossRef]
- Steinhart, Eric. (2010). Theological Implications of the Simulation Argument. Ars Disputandi, 10(1): 23–37. [CrossRef]
- Sutto, D. (2024). A Taxonomy for Set-Theoretic Potentialism. Philosophia Mathematica, nkae016. [CrossRef]
- Tarski, A., Mostowski, A., & Robinson, R. M. (1953). Undecidable theories. North-Holland Publishing Company.
- Thomas-Bolduc, A. R. (2016). Cantor, God, and inconsistent multiplicities. Studies in Logic, Grammar and Rhetoric, 44(1), 133-146. [CrossRef]
- von Neumann, J. (1928). Die Axiomatisierung der Mengenlehre. Mathematische Zeitschrift, 27(1), 669-752. [CrossRef]
- Welch, P., & Horsten, L. (2016). Reflecting on absolute infinity. The Journal of Philosophy, 113(2), 89-111. [CrossRef]
- Woodin, W. H. (2011). The continuum hypothesis, the generic-multiverse of sets, and the Ω conjecture. Set theory, arithmetic, and foundations of mathematics: theorems, philosophies, 36, 13-42. [CrossRef]
- Zermelo, E. (1908). Untersuchungen über die Grundlagen der Mengenlehre. I. Mathematische Annalen, 65(2), 261-281. [CrossRef]
- Zermelo, E. (1930). Über Grenzzahlen und Mengenbereiche: Neue Untersuchungen über die Grundlagen der Mengenlehre. Fundamenta mathematicae, 16, 29-47. [CrossRef]
| 1 | Not to be confused with Woodin’s ([32]) nor any other non-maximally great infinite cardinals. |
| 2 | While ordinals are inherently ordered, cardinals focus on the notion of ‘how many’ without regard to order. Assuming the axiom of choice, every set x can be well-ordered. In this case, every cardinal can be identified with the first ordinal that has size . |
| 3 | A theory is countably recursive iff it can be recursively enumerated on a standard Turing machine (having a countable memory tape length). This is often called formal. |
| 4 | As a metaphysical defense against finitism and Aristotelian potentialism, it must be acknowledged that the finite answers to many finite questions require arbitrarily strong transfinite computation. This brings an -long class ordinal Turing machine in the picture. |
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content. |
© 2026 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/).