Preprint
Article

This version is not peer-reviewed.

Beyond a Naive Absolute Infinite

Submitted:

22 June 2026

Posted:

23 June 2026

You are already at the latest version

Abstract
The axiom of maximal cardinality (AMC) asserts that 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 Ω. Three theorems are then proven to show that (1) AMC is not vacuously true, (2) AMC is not self-referentially inconsistent, and (3) Ω is a maximal cardinality. The maximality of this Ω implies it is Cantor's absolute infinite. While Gödel's incompleteness theorems presuppose the existence of a theory that interprets the notion 'countably recursive theory', AMC's theory interprets the notion 'theory'.
Keywords: 
;  ;  ;  ;  ;  

1. Introduction

In a letter to Dedekind, Cantor called his absolute infinite Ω 1 an inconsistent, absolutely infinite multiplicity and he associated it with God (Cantor [7], Thomas-Bolduc [29]). The absolute infinite is sometimes used in theology (Steinhart [26], Blondé [3]), but can be used for various other purposes too: in metaphysics and modal realism to describe the size of Lewis’ ([18]) logical space or the plenitude (Blondé [2]), in computer science to have the ultimate oracle (Burgin [6]) or ordinal2 machine (Koepke [16]), in epistemology to formulate omniscience (Heylen [14]), and in the philosophy of mathematics to have a maximal entity (Sutto [27]).
Cantor’s idea continues to provoke controversy. Welch and Horsten ([31]) review Cantor’s conception of the set-theoretic universe as a completed infinity and prefer it above Zermelo’s ([33]) conception, because Cantor’s universe includes the modern large cardinals via reflection principles. Livadas ([21]) also discusses Cantor’s absolute infinite in light of the modern large cardinals and argues that it is proof-theoretically unattainable. Gutschmidt and Carl ([10]) maintain that the foundational problem with Cantor’s absolute infinite calls for humility, rather than negative theology.
Set-theoretic potentialism, which has garnered significant attention in the last decade, is the view that the process of set formation is incompletable or inexhaustible and that the classical universe of sets V and the absolute infinite Ω cannot be fully captured or defined as actual, completed totalities (Zermelo [34], Putnam [24], Parsons [23], Hamkins [12], Linnebo [19], Hellman and Shapiro [13], Linnebo and Shapiro [20], Brauer et al. [4], Sutto [27]). Height potentialism can be distinguished from width potentialism. Height potentialism is the claim that certain large classes, such as the class of all natural numbers or the class of all sets, are not actual, but only potential classes. Width potentialism, on the other hand, asserts that there are no privileged axiomatic truths and that there is, therefore, no privileged universe of sets. Instead, there is a wide set-theoretic multiverse of potential multiverse-universes that are equally legitimate (Hamkins [12], Scambler [25], Meadows [22], Gorbow [9]). For example, a multiverse-universe in which the Continuum Hypothesis (CH) is true is not better or worse than one in which CH is false.
In spite of this, the aim of this paper is to show that an absolute infinite Ω can be proven to exist in a theory that can interpret the notion ‘theory’. This counters height potentialism. The next section introduces the axiom, definitions, and theorems that relate to the absolute infinite. In Section 3, the theorems are proven on the basis of the axiom and the definitions. After that, in Section 4, a range of objections to the existence of Ω is rebutted. At last, the conclusions follow in Section 5.

2. Toward an Absolute Infinite

2.1. Class Ordinals and Class Cardinals

Class ordinals and class cardinals are defined first as straightforward generalizations of ordinals and cardinals, which will be called set ordinals and set cardinals for clarity. The rationale for this generalization is to create terms to refer to the absolute infinite Ω , namely the proper class ordinal and the proper class cardinal, and unambiguous terms to refer to set ordinals and set cardinals. These terms are used directly in the axiomatization of Ω in Section 2.2. A set α is a set ordinal if and only if (henceforth iff) (Kunen [17], p. 16):
  • α is a transitive set.
  • ( α , ∈) is a well-ordering.
The Burali-Forti ([5]) paradox shows that the collection of all set ordinals Ord cannot be a set (Kunen [17], p. 17). If such a collection would be a set, it would exceed itself in size. However, a collection that is too large to be a set, such as Ord, can still be a class, namely a proper class (von Neumann [30]). Every set is a class, namely a class that is an element of another class, but not every class is a set. In particular, proper classes, which are classes that are not an element of any other class, are not sets. For example, the class-level axioms of NBG (von Neumann–Bernays–Gödel) can be used when a theory about sets and classes is needed (von Neumann [30]). With this notion of classes, class ordinals can be defined as an extension of set ordinals. A class C is a class ordinal iff:
  • C is a transitive class.
  • (C, ∈) is a well-ordering.
A class C is transitive iff whenever
x C y x y C
( C , ), with C some class, is a well-ordering iff every non-empty set s C has an ∈-least element:
s C , s : x s , y s , x y x y
This definition of class ordinal is a straightforward NBG-class-level generalization of the von Neumann definition of (set) ordinal. By the usual ordinal analysis (Kunen [17], p. 16), if C is a class ordinal and x C , then x is a set that is a set ordinal. A proper class ordinal is defined as any class ordinal that is not a set. Like any class, any class ordinal C is either a set or a proper class. If C is a set, then by definition of class ordinal it is transitive and well-ordered by ∈, and therefore C is a set ordinal. If C is not a set, then by definition it is a proper class ordinal. Hence we have a dichotomical ontology for class ordinals: every class ordinal is either a set ordinal or a proper class ordinal.
Just as for set ordinals in Kunen ([17], p. 17), the intersection of two class ordinals is again a class ordinal. In NBG, the intersection of two classes is again a class by class comprehension, so for class ordinals C 1 and C 2 , the intersection C : = C 1 C 2 is a class. It is transitive because any element of C is in both C 1 and C 2 , which are transitive. At last, ∈ well-orders C because any non-empty subclass of C is also a subclass of C 1 and C 2 , which are well-ordered by ∈.
Another result that is paralleled by set ordinals in Kunen ([17], p. 18) is that a class ordinal cannot be a proper subclass of another class ordinal unless it is an element of it: C 1 C 2 C 1 C 2 . This can be proven by showing that C 1 is the ∈-least element of the non-empty class C 2 C 1 . From this it follows that every class ordinal is an initial segment of any greater class ordinal and that we have trichotomical comparability with respect to ∈ between any pair of class ordinals: exactly one of α β , α = β , or β α , holds.
The proper class Ord is a proper class ordinal because it is transitive and well-ordered by ∈. Given that a proper class ordinal C p cannot be an element of any class, only the option C p = Ord remains in the trichotomical comparison. Consequently, Ord is the unique proper class ordinal in its theory. Ord is – again, in its theory – also the supremum of all set ordinals and it is maximal: no class ordinal in its theory exceeds it.
The notions ‘least’ and ‘maximal’ refer to the order ∈ imposes: α β iff α < β . The successor α + 1 of a set ordinal α is defined as S ( α ) = α { α } (Kunen [17], p. 18). By the usual ordinal analysis, the successor of a set ordinal is again a set ordinal. Ord cannot have a successor because Ord, being a proper class, cannot be an element of any class, and hence no class of the form Ord ∪{Ord} exists.
Because of the uniqueness and the maximality of proper class ordinals in a given theory, if the absolute infinite Ω provably exists as a class ordinal in some consistent class theory, it must be equal to a proper class ordinal. Class cardinals can be introduced in a similar way, such that we also have a proper class cardinal that is maximal and unique in its theory.

2.2. The Absolute Infinite: Axiom, Meta-Theory, Definition, and Theorems

This section provides the essence of the paper: the core axiom, a meta-theory that can interpret the axiom, a definition, and three essential theorems: non-vacuity, non-self-referential inconsistency, and maximality. In order to avoid any terminological circularity, the formulation of the core axiom that defines Ω is provided first:
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 Ω .
Both T and the class theory that extends it can have a class-sized (and thus Ω -sized) axiom class. Interpreting an axiom that is about theories and proving theorems about them is an endeavor that has similarities with proving Gödel’s ([8]) incompleteness theorems. With respect to the latter, we must distinguish the hierarchically organized countably recursive3 theories Gödel’s incompleteness theorems are about, from the meta-theoretical theory in which Gödel’s incompleteness theorems are proven. Gödel did not and could not treat this meta-theory as one of the countably recursive theories his theorems are about. Nevertheless, for AMC, we must assume the existence of a meta-theory M that interprets the notion ‘theory’ (including Ω -sized theories) and not just the notion ‘countably recursive theory’.
M is granted the least restrictive bounds that Ω can render by being expressed in an infinitary logic L κ , λ that extends the countable First-Order Logic and by having a signature τ with cardinality | τ | in which κ = λ = | τ | = Ω (Karp [15], Barwise [1]). Here, κ limits the size of conjunctions and disjunctions: only a number of sentences strictly smaller than κ can be combined. λ κ determines the maximum allowed length of a sequence of variables that can be bound by a single string of quantifiers (∃ or ∀). | τ | is the total number of the non-logical symbols (constants, functions, and predicates) that make up the signature τ . This means that M can have Ω -many axioms and that these can have any set ordinal length (strictly shorter than Ω ). AMC can be expressed in a shorter form thanks to the following definition:
Definition: A theory is Ω-consistent iff it can be consistently extended to a class theory proving the existence of Ω .
A sentence is Ω -consistent iff it is proven in an Ω -consistent theory. A set/class is Ω -consistent iff it provably exists in an Ω -consistent set/class theory. The Ω -consistency clause in AMC is required, because there are Ω -inconsistent theories that prove the existence of an Ω that is smaller than some set cardinal. Then Ω would be greater than itself in M. Consequently, AMC is a fixed-point definition of Ω .
Many investigations can be made to theories that prove AMC, have Ω -many axioms, prove all the Ω -consistent sentences, have proof-theoretic ordinal Ω , and/or have the role of True Arithmetic for all class ordinals (Tarski et al. [28]). Also the role of an Ω -long class ordinal Turing machine needs to be considered (Hamkins and Lewis [11], Koepke [16]). However, due to the maximality of Ω , such investigations can lead to controversial results that violate standard logical reasoning. For this reason, they are beyond the scope of this paper. The focus is on AMC and Ω . In the next section, three theorems are proven that counter three objections against AMC. The three theorems are:
  • There exists a theory that is Ω -consistent.
  • AMC is not self-referentially inconsistent.
  • Ω is a maximal cardinality.

3. Proving the Theorems

A natural objection against AMC is that it is vacuously true because there is no theory that is Ω -consistent. Theorem 1 refutes this objection:
Theorem 1. 
There exists a theory that is Ω-consistent
Proof. 
Suppose toward a contradiction that there is no theory T that is Ω -consistent: the set x T of the Ω -consistent theories T is empty. This means that Ω can easily satisfy AMC. For example, ‘ Ω = 0 ’ satisfies AMC in this case, because 0 is then greater than any set cardinality in any theory T in x T . But then there is a consistent theory T that is Ω -consistent. Indeed, any consistent theory proving the existence of 0 is then Ω -consistent for Ω = 0 , because it can be consistently extended to a class theory proving the existence of 0 . That is a contradiction. Therefore, there exists an Ω -consistent theory. □
Another natural objection against any definition of the absolute infinite is that this definition is self-referentially inconsistent. By making use of the consistency filter in AMC (only Ω -consistent theories are considered), this objection is refuted by the following theorem:
Theorem 2. 
AMC is not self-referentially inconsistent
Proof. 
Suppose toward a contradiction that AMC is self-referentially inconsistent. Then there is no Ω that satisfies AMC. That means that for any Ω that is inserted in AMC, it holds that this Ω is not greater than some set cardinal κ in some Ω -consistent theory T in M. But then T proves the existence of an Ω that is not greater than some set cardinal in some theory that is Ω -consistent, namely not greater than κ in T itself. Therefore, T cannot be consistently extended to a class theory proving the existence of an Ω that satisfies AMC. This makes T  Ω -inconsistent. That is a contradiction. Therefore, AMC is not self-referentially inconsistent. □
At last, the third objection is that AMC – the axiom of maximal cardinality – does not have the meaning its name suggests, because Ω is not a maximal cardinality. Theorem 3 counters this objection:
Theorem 3. 
Ω is a maximal cardinality
Proof. 
Suppose toward a contradiction that Ω is not a maximal cardinality. This means that there must exist a class cardinal in M that is greater than Ω . Consequently, Ω cannot be a proper class cardinal in M and must therefore be a set cardinal. As a result of that, there exists a consistent theory T in M in which Ω is a set cardinal. Because T is consistent and proves Ω exists, T can be consistently extended to a class theory proving the existence of Ω . That makes T  Ω -consistent. But then AMC can be applied to T in M, which makes Ω greater than itself in M. That is a contradiction. Therefore, the size of Ω is maximal. □

4. Further Objections

In this section, it is argued that the provided definition of Ω is robust by answering several further objections to it.

4.1. Ω Succumbs to the Burali-Forti Paradox

The Burali-Forti paradox demonstrates that naively constructing the set of all set ordinals leads to a contradiction, namely that the constructed set is both an element of itself and not an element of itself. By introducing class ordinals in Section 2.1, Ω can be constructed as a proper class ordinal that is equal to the class of all set ordinals OrdΩ, rather than the set of all set ordinals.

4.2. Ω Is Smaller Than Ω + 1

An ordinal Ω + 1 is not defined in any Ω -consistent theory. (Without Ω -consistency, Ω can be redefined to a set ordinal like 5 or ω , making it trivially smaller than Ω + 1 .) Since any successor construction requires { Ω } , which is not defined, Ω + 1 cannot be formed. In a class theory, it is a category mistake to apply a successor operator to Ω , because Ω is a proper class and not a set. If both a theory-specific Ω * and Ω * + 1 are well defined in the same consistent theory, then they are both set ordinals and therefore strictly smaller than Ω . The same reasoning shows that, assuming Ω -consistency, a meta-meta-theoretic level, a powerset operation, or any other enlarging operation cannot make Ω smaller than something else, because all these operations require the formation of { Ω } .

4.3. Ω Should Not Occur Twice in AMC

Ω is referenced twice in AMC, just like self-referentially inconsistent definitions like “There exists a class cardinal Ω that is greater than the power set of Ω .” However, being referenced twice does not by itself entail self-referential inconsistency, as acknowledged by Theorem 2. Moreover, the following axiom in which Ω occurs only once is self-referentially inconsistent: “There exists a class cardinal Ω that is greater than any set cardinal in any theory T that is consistent.” Among all the consistent theories T, there are T’s that define Ω as a set cardinal. A consistent theory that defines Ω as the smallest transfinite cardinal 0 is an example of such a T. Therefore, by referencing Ω twice in AMC, self-referential inconsistency is avoided instead of provoked.

4.4. Ω Comes in Many Varieties

An absolute infinite Ω T is sometimes defined as the proper class ordinal or cardinal of a given countably recursive class theory T independent from AMC. In this case, there are many theory-dependent Ω T ’s. Ω as defined via AMC is uniquely defined as greater than all the Ω T ’s in any Ω -consistent T of this kind. This is a unique, theory-independent definition.

5. Conclusions

This paper shows first that a theory-dependent maximality can be defined via proper class ordinals and proper class cardinals. For a theory-independent maximality, it uses a fixed-point axiom of maximal cardinality AMC that asserts the existence of a cardinality Ω that transcends all set cardinals in all Ω -consistent theories. This counters height potentialism. Interpreting AMC requires a theory that interprets the notion ‘theory’.
Three essential objections can be made: (1) that AMC is vacuously true because there is no theory that is Ω -consistent, (2) that AMC is self-referentially inconsistent, and (3) that Ω is not a maximal cardinality. These objections are countered by three theorems that are proven. Some further objections are also rebutted: that Ω succumbs to the Burali-Forti paradox, that Ω is smaller than Ω + 1 , that Ω should not occur twice in AMC, and that Ω comes in many varieties.
Height potentialism will not be entirely abandoned by this absolutist philosophy. It remains viable for those who reject AMC or theories that interpret the notion ‘theory’. After all, even the axiom of infinity is not universally accepted, in particular not by finitists and philosophers who interpret a potential infinity as being about the least upper bound of the natural numbers.4 The aim of this paper is to show that an absolute infinite is not incoherent and can be consistently axiomatized, making it a viable philosophical phenomenon.

Funding

This research received no external funding.

Data Availability Statement

No new data were created or analyzed for this research.

Acknowledgments

I wish to thank Ludger Jansen and anonymous referees for their feedback on earlier versions of this paper. During the preparation of this manuscript, I used the free versions of ChatGPT, Gemini, Copilot, Claude, and Google AI as intellectual sparring partners. I have reviewed and edited the output and take full responsibility for the content of this publication.

Conflicts of Interest

The author declares no conflicts of interest.

Abbreviations

The following abbreviations are used in this manuscript:
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

  1. Barwise, J. (1967). Infinitary Logic and Admissible Sets. Ph.D. Thesis, Stanford University.
  2. Blondé, W. (2024). Proving predeterminism, or why actuality is certainly actual. Symposion, 11(2), 141-158. [CrossRef]
  3. Blondé, W. (2025). God as absolute machine: aligning modern formalisms to prove God. Forum Philosophicum, 30(2), 65-86. [CrossRef]
  4. Brauer, E., Linnebo, Ø., & Shapiro, S. (2022). Divergent potentialism: a modal analysis with an application to choice sequences. Philosophia Mathematica, 30(2), 143-172. [CrossRef]
  5. Burali-Forti, C. (1897). Una questione sui numeri transfiniti. Rendiconti del Circolo Matematico di Palermo (1884-1940), 11(1), 154-164. [CrossRef]
  6. 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]
  7. Cantor, G. (1962). Gesammelte Abhandlungen, ed. E. Zermelo, Hildesheim: Georg Olms Verlagsbuchhandlung, 443–447. [CrossRef]
  8. 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]
  9. Gorbow, P. K., & Leigh, G. E. (2022). The Copernican Multiverse of Sets. The Review of Symbolic Logic, 15(4), 1033-1069. [CrossRef]
  10. Gutschmidt, R., & Carl, M. (2024). The negative theology of absolute infinity: Cantor, mathematics, and humility. International Journal for Philosophy of Religion, 1-24. [CrossRef]
  11. Hamkins, J. D., & Lewis, A. (2000). Infinite time Turing machines. The Journal of Symbolic Logic, 65(2), 567-604. [CrossRef]
  12. Hamkins, J. D. (2012). The set-theoretic multiverse. The Review of Symbolic Logic, 5(3), 416-449. [CrossRef]
  13. Hellman, G., & Shapiro, S. (2018). Mathematical structuralism. Cambridge University Press. [CrossRef]
  14. Heylen, J. (2020). Factive knowability and the problem of possible omniscience. Philosophical Studies, 177, 65-87. [CrossRef]
  15. Karp, C. (1964). Languages with Expressions of Infinite Length. Amsterdam: North-Holland.
  16. Koepke, P. (2005). Turing computations on ordinals. Bulletin of Symbolic Logic, 11(3), 377-397. [CrossRef]
  17. Kunen, K. (1980). Set theory Elsevier.
  18. Lewis, D. K. (1986). On the plurality of worlds. Oxford: Blackwell.
  19. Linnebo, Ø. (2013). The potential hierarchy of sets. The Review of Symbolic Logic, 6(2), 205-228. [CrossRef]
  20. Linnebo, Ø., & Shapiro, S. (2019). Actual and potential infinity. Noûs, 53(1), 160-191. [CrossRef]
  21. Livadas, S. (2020). Why is Cantor’s Absolute Inherently Inaccessible? Axiomathes, 30(5), 549-576. [CrossRef]
  22. Meadows, T. (2021). Two arguments against the generic multiverse. The Review of Symbolic Logic, 14(2), 347-379. [CrossRef]
  23. Parsons, C. (1983), Mathematics in philosophy, Ithaca, New York, Cornell University Press.
  24. Putnam, H. (1967). Mathematics without foundations. The Journal of Philosophy, 64(1), 5-22. [CrossRef]
  25. Scambler, C. (2020). An indeterminate universe of sets. Synthese, 197(2), 545-573. [CrossRef]
  26. Steinhart, Eric. (2010). Theological Implications of the Simulation Argument. Ars Disputandi, 10(1): 23–37. [CrossRef]
  27. Sutto, D. (2024). A Taxonomy for Set-Theoretic Potentialism. Philosophia Mathematica, nkae016. [CrossRef]
  28. Tarski, A., Mostowski, A., & Robinson, R. M. (1953). Undecidable theories. North-Holland Publishing Company.
  29. Thomas-Bolduc, A. R. (2016). Cantor, God, and inconsistent multiplicities. Studies in Logic, Grammar and Rhetoric, 44(1), 133-146. [CrossRef]
  30. von Neumann, J. (1928). Die Axiomatisierung der Mengenlehre. Mathematische Zeitschrift, 27(1), 669-752. [CrossRef]
  31. Welch, P., & Horsten, L. (2016). Reflecting on absolute infinity. The Journal of Philosophy, 113(2), 89-111. [CrossRef]
  32. 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]
  33. Zermelo, E. (1908). Untersuchungen über die Grundlagen der Mengenlehre. I. Mathematische Annalen, 65(2), 261-281. [CrossRef]
  34. 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 | x | can be identified with the first ordinal that has size | x | .
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.
Copyright: This open access article is published under a Creative Commons CC BY 4.0 license, which permit the free download, distribution, and reuse, provided that the author and preprint are cited in any reuse.
Prerpints.org logo

Preprints.org is a free preprint server supported by MDPI in Basel, Switzerland.

Subscribe

© 2026 MDPI (Basel, Switzerland) unless otherwise stated

Accessibility

Disclaimer

Terms of Use

Privacy Policy

Privacy Settings