Preprint
Article

This version is not peer-reviewed.

Beyond a Naive Absolute Infinite

Submitted:

13 October 2026

Posted:

14 October 2026

You are already at the latest version

Abstract
Class ordinals and class cardinals are first defined as an extension of ordinals and cardinals, which are called set ordinals and set cardinals. In order to create an unambiguous definition of a maximally large class, this definition needs to quantify over all set theories. Accordingly, the Axiom of Maximal Strength (AMS) asserts that there exists a class cardinal that does not Ω+-provably exist in any MK-extending TM-fragment that has an injective theorem-preserving Ω+-interpretation into a ZFC-extending TM-fragment that is definable by a formula without parameters in the infinitary first-order language L∞,∞, where Ω+-provability and Ω+-interpretability are defined in a logic that can make a number of deductive steps equal to the number of sentences in L∞,∞. This logic is called Ω+-logic. The meta-theory TM that interprets AMS is presupposed to be Ω+-sound, Ω+-complete, and an infinitary extension of MK. It is then proven that TM is Ω+-consistent with AMS, that TM is maximally strong, and that the class Ord of all the ordinals TM proves to exist, is an Ω+-consistent version of Cantor's absolute infinite Ω.
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 [27], Blondé [3]), but can be used for various other purposes too: in metaphysics and modal realism to describe the size of Lewis’ ([19]) logical space or the plenitude (Blondé [2]), in computer science to have the ultimate oracle (Burgin [6]) or ordinal2 machine (Koepke [17]), in epistemology to formulate omniscience (Heylen [15]), and in the philosophy of mathematics to have a maximal entity (Sutto [28]).
Cantor’s idea continues to provoke controversy. Welch and Horsten ([32]) review Cantor’s conception of the set-theoretic universe as a completed infinity and prefer it above Zermelo’s ([34]) conception, because Cantor’s universe includes the modern large cardinals via reflection principles. Livadas ([22]) also discusses Cantor’s absolute infinite in light of the modern large cardinals and argues that it is proof-theoretically unattainable. Gutschmidt and Carl ([11]) 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 [35], Putnam [25], Parsons [24], Hamkins [13], Linnebo [20], Hellman and Shapiro [14], Linnebo and Shapiro [21], Brauer et al. [4], Sutto [28]). 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 [13], Scambler [26], Meadows [23], Gorbow [10]). 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 axiom of maximal strength (AMS) that is consistent with a maximally strong meta-theory T M , establishes the existence of an absolutely maximally large infinity Ω . The next section introduces Ω via class ordinals, class cardinals, the axiom AMS, some definitions, the meta-theory T M , and eight theorems. In Section 3, the theorems are proven on the basis of AMS and T M . After that, in Section 4, a range of objections to Ω and its existence 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 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 maximal ordinals and cardinals, namely the proper class ordinal and the proper class cardinal, and unambiguous terms to refer to set ordinals and set cardinals. A set α is a set ordinal if and only if (henceforth iff) (Kunen [18], p. 16):
1.
α is a transitive set.
2.
( α , ∈) is a well-ordering.
The Burali-Forti ([5]) paradox shows that the collection of all set ordinals Ord cannot be a set (Kunen [18], p. 17). If such a collection would be a set, it would be greater than 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 MK (Morse–Kelley) can be used when a theory about sets and classes is needed (Wang [31]). With this notion of classes, class ordinals can be defined as an extension of set ordinals. A class C is a class ordinal iff:
1.
C is a transitive class.
2.
(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 an MK-class-level generalization of the von Neumann definition of (set) ordinal. By the usual ordinal analysis (Kunen [18], 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 ([18], p. 17), the intersection of two class ordinals is again a class ordinal. In MK, 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 ([18], 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 within any given model of MK. Ord is – again, within any given model – also the supremum of all set ordinals and it is maximal: no class ordinal in the model is greater than it.
The notions `least’ and `maximal’ refer to the order ∈ imposes: α ∈ β iff α < β . The successor α + 1 of a set ordinal α is defined as S ( α ) = α ∪ { α } (Kunen [18], 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.
By using the axiom of choice, every set cardinal can be equated with its initial set ordinal and the proper class cardinal | V | with the proper class ordinal Ord. In this way, we also have a proper class cardinal that is maximal and unique. Here, | V | is the size of the von Neumann universe of all sets V. Nevertheless, as we will see in what follows, there are infinitely many non-maximally strong theories that have infinitely many non-maximally large models, and | V | and Ord are different in each of these. The symbol Ω is reserved for the | V | and Ord that provably exist according to the maximally strong theory T M (to be defined later).

2.2. The Absolute Infinite Through Familiar Concepts

In this paper, the absolute infinite is viewed via the Axiom of Maximal Strength (AMS). Nevertheless, there are ways to conceive of the absolute infinite through concepts that are already familiar. To begin with, AMS is a more advanced version of the following finite second-order Axiom of Maximal Cardinality (AMC): “There exists a class cardinal with the size of the class that contains every set.” AMC is second-order because it quantifies over all first-order definable objects, namely the sets.
According to a naive, theory-unaware view, the class cardinal in AMC is Ω and the class that contains every set is the true universe V. However, axiomatic set theory has much progressed since its early days, such that there are now many mutually inconsistent and relatively consistent theories that interpret AMC and its proper classes differently. Each theory has infinitely many universe models that make all the axioms of the theory true. For example, a model of a theory in which CH is true is irreconcilable with the models of a theory in which ¬CH is true. Relatively consistent theories do not seem to make this situation better: a universe model of one theory can then be interpreted to be a set that is provably smaller than a universe model of the other theory.
This state of affairs thus results in infinitely many different false points of view on the true V and its cardinality Ω , which is why the existential status of the true V, and certainly that of Ω , is currently undermined. This paper aims to rehabilitate Ω and the true V by pointing out that they can be correctly viewed through the lens of a maximally strong theory. The theories mathematicians use for practical purposes are necessarily insufficient to prove the existence of Ω and the true V.
The solution to this problem is uncomplicated: just like AMC is a finite second-order axiom that quantifies over all first-order-set-definable set objects, AMS is a finite second-order axiom that quantifies over all first-order-set-definable set theories. In both cases, transfinitely long definitions are explicitly taken into consideration. This implies that the concept `theory’ is itself elevated to a more theoretical level. Theories with transfinitely long definitions may not be practically manageable, however, this problem is not a good argument to claim that Ω is poorly defined.
The counterargument that AMC does not suffice to prove the existence of Ω uses the exact same theoretical approach by making a second-order quantification over theories: “No recursively enumerable, nor even any first-order-set-interpretable theory, can prove the existence of a maximally large class cardinal Ω .” Without such a second-order quantification, the counterargument stalls. The claim that some particular recursively enumerable theory like MK cannot prove the existence of Ω may be true, it remains without consequences by the fact that some strong extension of MK might very well prove the existence of Ω .
Another example of a second-order quantification over theories, namely all recursively enumerable theories, is Gödel’s ([9]) incompleteness theorems. The first can be formulated as: “No recursively enumerable theory is capable of proving all truths about the arithmetic of natural numbers.” Consequently, the argument that AMS is somehow false or illegitimate because it makes a second-order quantification over theories cannot be maintained.
A second way to conceive of the absolute infinite through a concept that is already known is through the concept L ∞ , ∞ (Karp [16], Barwise [1]), which is an infinitary first-order language that permits set-many conjunctions and disjunctions over set-many variables.3 Because every set is well-founded in MK, it is always possible to write down a parameter-free set-ordinal-length formula that describes all the elements in its transitive closure. That makes every set in the true universe of all sets definable by a single sentence in L ∞ , ∞ . In the other direction, every sentence consists of symbols and can be mapped to a unique set. This results in the following Axiom of Maximal Expressivity (AME): “There exists a class cardinal that is equal to number of sentences in L ∞ , ∞ .” This class cardinal in AME is thus equal to the absolute infinite Ω of AMC. The language L ∞ , ∞ will also be used later on to construct a maximally powerful infinitary first-order logic and a maximally strong infinitary theory.

2.3. Is Absolutely Everything a Class?

Choosing for a class theory such as MK in an absolutist context comes with the ontological commitment that absolutely every object is a class. The defense of this commitment is that all logically possible things – including classes – are objects that contain information and that sufficiently large information objects can be decoded without any external code book. Indeed, they can use an arbitrarily large internal code book. In this way, objects in all ontological categories can be a class: sets, collections, numbers, graphs, Ordinal Turing Machines (Hamkins and Lewis [12], Koepke [17]), axiomatic theories, models of axiomatic theories, and even physical worlds. There is no experiment that an intelligent physical being can conduct to find out whether or not it is a class or is computed by an abstract Ordinal Turing Machine. This is purely a matter of convention.
A consequence of this approach is that we get a multi-layered ontology in which the same object can have contradictory properties indexed by different layers. A collection can then be a well-founded class in the deepest layer, while being non-well-founded in a higher layer. A physical replica of a class with five members can have the property of being an enormous class containing the information of all the sub-atomic particles that make up the replica in the deepest layer, while being a class with five members in the highest layer. Likewise, a data structure in a software program can be a two-valued string of bits in the deepest software layer, while being a string of characters or a photo in the highest layer. When we say that absolutely everything is a class, we refer to the deepest ontological layer.

2.4. Axiom, Definitions, Meta-Logic, and Meta-Theory

This section provides the axiom AMS, some definitions, a meta-logic called Ω + -logic,4 and a meta-theory T M that is Ω + -consistent with AMS. Since AMS is about theories, ZFC (Zermelo–Fraenkel set theory with the axiom of choice, Zermelo [34]) and MK are chosen as a foundation for set theories and class theories, respectively. We begin with AMS:
Axiom of Maximal Strength (AMS): There exists a class cardinal that does not Ω + -provably exist in any MK-extending T M -fragment that has an injective theorem-preserving Ω + -interpretation into a ZFC-extending T M -fragment that is definable by a formula without parameters in the infinitary first-order language L ∞ , ∞ , where Ω + -provability and Ω + -interpretability are defined in a logic that can make a number of deductive steps equal to the number of sentences in L ∞ , ∞ .
In this way, the definition of Ω depends on that of L ∞ , ∞ . The cardinal mentioned will provisionally be called AMS’s class cardinal. It will be proven to be equal to the class ordinal Ord T M in Theorem 5 and equal to the absolute infinite Ω in Theorem 8. The following definitions are needed to interpret AMS:
Definition: A theory T is a T M -fragment iff it is an infinitary fragment of the meta-theory T M (hence T ⊆ T M ).
Note that also the meta-theory T M is a T M -fragment and that finitary theories are also considered to be infinitary theories in this paper.5
Definition: Ω + -logic is the infinitary first-order logic with identity and membership that can make a number of deductive steps that is equal to the number of sentences that can be expressed in the infinitary first-order language L ∞ , ∞ .
Definition: Ω + -provability and Ω + -interpretability mean provability and interpretability using Ω + -logic.
Proofs in Ω + -logic can be proper-class-sized, rather than being set-sized or finite. If proofs must remain set-sized, they can, for example, never witness that a given structure is isomorphic to the true universe of all sets V.
Definition: An infinitary theory T is Ω + -consistent iff no contradiction can be derived from the axioms of T, using Ω + -logic.
These definitions use the convention that a κ + -logic can make at most κ deductive steps and a κ -logic strictly less than κ steps, with κ some class ordinal. Ordinary (finitary) consistency is then called ω -consistency, and the ω -consistency Gödel used in his incompleteness theorem is then ω + -consistency.
In fact, Ω + -consistency genuinely deserves to be called consistency, given that other types of consistency are entailed by Ω + -consistency. However, set-limited deductive systems may fail to derive a contradiction in a theory that is not even Ω -consistent and thus conclude that the theory is consistent. Consequently, there are `consistent’ theories that do not have a model. Furthermore, if arbitrary L ∞ , ∞ -sentences are allowed, while the deduction of neither Ω + -logic nor even Ω -logic6 is used in the definition of consistency, one comes to the conclusion that infinitary theories are not well behaved with respect to the principle that every consistent theory has a model (Dickmann [8]). The following definitions enable AMS to be expressed in a shorter form:
Definition: A ZFC-extending T M -fragment T is first-order-set-definable iff T is definable by a formula without parameters in the infinitary first-order language L ∞ , ∞ .
This means that the theorems of T and the sentences that assert the existence of the set cardinality of the set of theorems of T and the supremum of the lengths of the theorems of T, are all theorems that are provable by a pure (first-order-set-definable) infinitary ZFC extension.
Definition: An MK-extending T M -fragment is first-order-set-interpretable iff it has an injective theorem-preserving Ω + -interpretation into a first-order-set-definable ZFC-extending T M -fragment.
First-order-set-interpretability can also be applied to classes:
Definition: A class is first-order-set-interpretable iff it provably exists in a first-order-set-interpretable MK-extending T M -fragment.
Otherwise, the class is non-first-order-set-interpretable. Combining the definitions results in the following shortened expression of AMS:
Shortened AMS: There exists a non-first-order-set-interpretable class cardinal.
Some more definitions are needed to efficiently express the presuppositions about T M and the theorems in the next section:
Definition: A class x is T-provable iff the theory T proves that x exists.
Definition: An infinitary theory T has a model iff there exists a model that makes all the axioms of T true.
Definition: An infinitary theory T is Ω + -sound iff no falsehoods can be derived from the axioms of T, using Ω + -logic.
Definition: The infinitary first-order language L ∞ + , ∞ + permits a number κ of conjunctions and disjunctions over a number λ of variables, where κ can be any arbitrarily large class cardinal and λ ≤ κ .
While L ∞ , ∞ has proper-class-many set-ordinal-long sentences, L ∞ + , ∞ + has proper-class-many class-ordinal-long sentences.
Definition: An MK-extending T M -fragment T is Ω + -complete iff for every sentence ϕ in the language L ∞ + , ∞ + , either T ⊢ ϕ or T ⊢ ¬ ϕ .
Definition: Ord T of an MK-extending T M -fragment T is the class of all T-provable set ordinals.
Definition: A theory T is maximally strong iff in any Ω + -sound theory T S , all T S -provable objects are T-provable objects.
The proofs of the theorems require a meta-theory T M about which we need to make some presuppositions:
1.
T M is Ω + -sound.
2.
T M is Ω + -complete.
3.
T M is an infinitary extension of MK.
Presupposition 1: This presupposition entails Ω + -consistency. If T M were Ω + -inconsistent, T M + AMS would be Ω + -inconsistent, in which case Ω + -logic derives a contradiction from the assertion that Ω exists. This amounts to the conclusion that Ω does not exist according to T M . For the adherents of width potentialism and truth relativism, presupposing soundness is not a standard practice, because that fixes the truth value of every axiom of the theory in a way that makes all the theories unsound that contradict these axioms. However, from a theory that is not Ω + -sound, Ω + -logic derives theorems that are false. Because of this argument, Ω + -soundness is an important requirement in an absolutist orientation. Even if T M proves its own Ω + -soundness, provided it is Ω + -sound, T M will also prove its own Ω + -soundness, provided it is not Ω + -sound. This makes the assertion that T M is Ω + -sound necessary as a presupposition.
Presupposition 2: This presupposition is needed to exclude that T M has a meta-theory that proves theorems T M cannot prove. Having such a meta-theory would make T M objectively inferior as a theory and inappropriate as a basis to prove truths about all of reality.
Presupposition 3: MK is adopted because it is an extension of ZFC, the standard axiomatic foundation for mathematics, that can accommodate AMS’s class cardinal. Because of our mathematical experience with this foundation, MK can be presupposed to be sound and Ω + -sound, as entailed by Presupposition 1. If someday a consensus grows that MK or ZFC is unsound, it needs to be replaced with a foundation that is sound. While NBG (von Neumann–Bernays–Gödel) (von Neumann [30]) is a conservative extension of ZFC with respect to set-theoretic sentences, MK extends NBG with a full truth predicate for first-order set-theoretic formulas. Because of this, T M can express the `first-order-set-definable’ in AMS as a legitimate predicate. Furthermore, because NBG cannot prove the existence of impredicatively defined classes, T M could not be maximally strong if it did not extend MK.
With these definitions and presuppositions, the following theorems are proven in Section 3:
1.
An infinitary first-order theory has a model iff it is Ω + -consistent.
2.
Every T M -fragment has a model.
3.
A T M -fragment cannot be both Ω + -complete and first-order-set-interpretable.
4.
An MK-extending T M -fragment T is first-order-set-interpretable if Ord T is first-order-set-interpretable.
5.
Ord T M is a non-first-order-set-interpretable class cardinal.
6.
T M is Ω + -consistent with AMS.
7.
T M is maximally strong.
8.
Ord T M is an Ω + -consistent version of Cantor’s absolute infinite Ω .

3. Proving the Theorems

In this section, the theorems are proven that work toward the conclusion that AMS’s non-first-order-set-interpretable class cardinal can be equated with an Ω + -consistent version of Cantor’s absolute infinite Ω . In order to prove the Ω + -consistency of AMS relative to T M in theorem 6, some preparatory theorems are needed first:
Theorem 1. 
An infinitary first-order theory has a model iff it is Ω + -consistent.
Proof. 
Because any model that makes all the axioms of an infinitary theory true counts as a model of the theory, an infinitary first-order theory has a model iff no contradictions can be derived from the axioms of the theory using a first-order logic that can derive all the deductive consequences of the axioms of the theory. A first-order logic can derive all the deductive consequences of the axioms of an infinitary first-order theory iff the number of deductive steps the logic can make is greater or equal to the total number of conjunctions and disjunctions in the conjunction of all the axioms of the theory. Ω + -logic is a first-order logic that can make a number of deductive steps that is equal to the number of L ∞ , ∞ -sentences. The number of sentences in L ∞ , ∞ is proper-class-sized and is therefore equal to the total number of conjunctions and disjunctions in the conjunction of all the sentences in L ∞ + , ∞ + . Every infinitary first-order theory can be expressed by a single sentence in L ∞ + , ∞ + . As a result, all the deductive consequences of any infinitary first-order theory can be derived by Ω + -logic. Consequently, an infinitary first-order theory has a model iff no contradictions can be derived from the theory using Ω + -logic. Therefore, an infinitary first-order theory has a model iff it is Ω + -consistent. □
Theorem 2. 
Every T M -fragment has a model.
Proof. 
Let T be a T M -fragment: T ⊆ T M . By Presupposition 1 ( T M is Ω + -sound), no falsehoods can be derived from the axioms of T M using Ω + -logic, and thus no contradictions either. Therefore, T M is Ω + -consistent. Because T is a fragment of T M , T is also Ω + -consistent. The fragments of T M are expressible as single-sorted first-order theories in the language L ∞ + , ∞ + , where the domain of discourse consists of classes. Consequently, T qualifies as an infinitary first-order theory. By Theorem 1, T then has a model. □
Theorem 3. 
A T M -fragment cannot be both Ω + -complete and first-order-set-interpretable.
Proof. 
Suppose toward a contradiction that T is a T M -fragment that is both Ω + -complete and first-order-set-interpretable. Since T is Ω + -complete, for every sentence ϕ ∈ L ∞ + , ∞ + , either T ⊢ ϕ or T ⊢ ¬ ϕ . Hence T has at least as many distinct theorems as there are distinct L ∞ , ∞ -sentences. Since L ∞ , ∞ contains sentences of arbitrarily large set-ordinal lengths for T M -provable set ordinals, the class of its sentences is a proper class in T M . Consequently, Thm(T), the class of all the theorems of T, is also a proper class in T M .
Because T is first-order-set-interpretable, there exists an injective theorem-preserving Ω + -interpretation τ : T → T Z F C of T into a first-order-set-definable ZFC-extending T M -fragment T Z F C . Since τ is injective and theorem-preserving, distinct theorems of T yield distinct theorems of T Z F C . Thus the collection of all theorems of T Z F C must also be a proper class in T M . But T Z F C is first-order-set-definable, which means that its collection of theorems has set cardinality in T M . That is a contradiction. Therefore, a T M -fragment cannot be both Ω + -complete and first-order-set-interpretable. □
Theorem 4. 
An MK-extending T M -fragment T is first-order-set-interpretable if Ord T is first-order-set-interpretable.
Proof. 
Suppose T is an MK-extending T M -fragment and Ord T , the class of all the T-provable set ordinals, is first-order-set-interpretable. Then Ord T provably exists in an MK-extending T M -fragment T 2 that has an injective, theorem-preserving Ω + -interpretation τ in a first-order-set-definable ZFC-extending T M -fragment T 3 . Because T and T 2 are T M -fragments, they have a model according to Theorem 2. Moreover, because Ord T provably exists within the infinitary MK-extension T 2 , T 2 can internally construct a model of T through impredicative class comprehension and class transfinite recursion (recursive constructions of classes along well-orderings) in MK. By impredicative class comprehension, T 2 can prove that its internal construction satisfies the infinitary axioms of T. By class transfinite recursion, T 2 can iterate the model-building steps (like taking power sets and definable subsets) unboundedly up to Ord T . This inner-model construction warrants that there exists an injective, theorem-preserving Ω + -interpretation τ 1 : T → T 2 . By composing τ 1 and τ , we get τ 3 = τ ∘ τ 1 : T → T 3 . τ 3 is injective because the composition of two injective Ω + -interpretations is injective. τ 3 is also theorem-preserving: T ⊢ ϕ iff T 2 ⊢ τ 1 ( ϕ ) iff T 3 ⊢ τ ( τ 1 ( ϕ ) ) . Consequently, T has an injective, theorem-preserving Ω + -interpretation in a first-order-set-definable ZFC-extending T M -fragment, namely T 3 . Therefore, T is first-order-set-interpretable. □
Theorem 5. 
Ord T M is a non-first-order-set-interpretable class cardinal.
Proof. 
According to Theorem 3, the T M -fragment T M cannot be both Ω + -complete and first-order-set-interpretable. By Presupposition 2, T M is Ω + -complete. Therefore, T M is not first-order-set-interpretable. According to Theorem 4, the MK-extending T M -fragment T M is first-order-set-interpretable if Ord T M is first-order-set-interpretable. By contrapositive, Ord T M is not first-order-set-interpretable. By the axiom of choice, Ord T M is a class cardinal by being the first class ordinal with size | Ord T M | . Therefore, Ord T M is a non-first-order-set-interpretable class cardinal. □
Theorem 6. 
T M is Ω + -consistent with AMS.
Proof. 
According to Theorem 5, Ord T M is a non-first-order-set-interpretable class cardinal. Therefore Ord T M satisfies the existential assertion of AMS (There exists a non-first-order-set-interpretable class cardinal). Because T M extends MK (Presupposition 3), we also have that T M proves Ord T M to exist. Since T M is also Ω + -consistent by the Ω + -soundness of T M (Presupposition 1), T M is Ω + -consistent with AMS. □
Theorem 7. 
T M is maximally strong.
Proof. 
Let T S be any arbitrary theory that is Ω + -sound. Assume T S proves the existence of an object x. In the language L ∞ + , ∞ + , x corresponds to a theorem that can be written as T S ⊢ ∃ x ϕ ( x ) . Because T S is Ω + -sound, the sentence ∃ x ϕ ( x ) must be true. By Presupposition 2 ( T M is Ω + -complete) T M either proves this sentence or proves its negation. By Presupposition 1, ( T M is Ω + -sound) T M cannot prove the negation of this sentence, because that negation is false. Therefore, T M ⊢ ∃ x ϕ ( x ) . Since this argument applies to any object proven to exist by any Ω + -sound theory T S , all T S -provable objects are T M -provable objects. By definition, this makes T M maximally strong. □
Theorem 8. 
Ord T M is an Ω + -consistent version of Cantor’s absolute infinite Ω.
Proof. 
According to Theorem 7, T M is maximally strong. This means that for any theory T to prove the existence of an object that is not a T M -provable object, T must prove falsehoods. Consequently, T M is the only legitimate source of truth about reality and about the question whether Ord T M is an Ω + -consistent version of Cantor’s absolute infinite. Of all the objects that T M proves to exist, none has a cardinality that is greater than the cardinality of Ord T M . By the axiom of choice, Ord T M is both a class cardinal and a class ordinal. Furthermore, as a result of the Ω + -soundness of T M (Presupposition 1), T M is an Ω + -consistent theory. Therefore, Ord T M is an Ω + -consistent version of Cantor’s absolute infinite Ω . □

4. Objections

In this section, it is argued that the provided definition of Ω is robust by answering several 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 in T M , rather than the set of all set ordinals.

4.2. Ω Is Smaller than Ω + 1

An ordinal Ω + 1 is not defined in any theory that is Ω + -consistent with T M . (Without this 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 T M -consistent theory, then they are both set ordinals and therefore strictly smaller than Ω . The same reasoning shows that, assuming T M -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 { Ω } .
The usage of the `+’ symbol in Ω + -logic may seem to suggest that something larger than Ω exists. However, it indicates that proofs can have length Ω . The notation without the `+’ symbol is already needed to indicate that proofs can have any arbitrary set-ordinal length, but not length Ω .

4.3. Ω and the Universe V are Always Extensible

A possible objection of the height potentialist is that the universe of all sets V is always extensible. However, `universe’ is not a good name for something that is extensible. The terminologically ideal solution is that V is a non-extensible entity, just like its cardinality Ω . If such a V cannot be defined via the standard axiomatic toolbox, then this is a sign that this toolbox needs to be enriched and not that a universe is an extensible entity. A non-maximal model of an incomplete theory is rather a `universe view’ than the true universe itself.

4.4. Ω Is Already Used in AMS to Define Ω

The objection could be made that AMS uses Ω + -provability, which requires a definition of Ω + -logic, and that the latter definition requires a definition of Ω . Therefore, the definition of Ω is circular. However, even though Ω + -logic uses the symbol Ω in its name, its definition is derived from the definition of L ∞ , ∞ , which is the language that contains every set-long infinitary first-order sentence. Therefore, just like AMC and AME, AMS does not require prior knowledge about Ω .

4.5. T M Violates Gödelian Limitations

If the meta-theory T M were recursively enumerable, then T M would have been subjected to the limitations of Gödel’s incompleteness theorems. However, a recursively enumerable theory can prove only a countable number of theorems, while T M proves an absolutely infinite number of theorems, namely one for each sentence in L ∞ + , ∞ + , as a result of Presupposition 2. T M is therefore two steps beyond a recursively enumerable theory (with non-recursively enumerable first-order-set-interpretable theories as intermediate step) such that Gödel’s incompleteness theorems cannot be applied.

5. Conclusions

This paper shows first that a theory- and model-dependent maximality can be defined via proper class ordinals and proper class cardinals. For a maximality that is absolute, it uses the Axiom of Maximal Strength AMS that asserts that there exists a class cardinal Ω that does not Ω + -provably exist in any MK-extending T M -fragment that has an injective theorem-preserving Ω + -interpretation into a ZFC-extending T M -fragment that is definable by a formula without parameters in the infinitary first-order language L ∞ , ∞ . Ω + -provability and Ω + -interpretability are defined using Ω + -logic, which is powerful enough to enable as many deductive steps as the number of sentences in L ∞ , ∞ .
AMS is a more advanced version of the Axiom of Maximal Cardinality (AMC): “There exists a class cardinal Ω with the size of the class that contains every set.” However, when AMC is analyzed in the context of multiple recursively enumerable – or otherwise non-maximally strong – class theories, multiple non-maximal Ω ’s appear. The solution is the following: just like AMC is a finite second-order axiom that quantifies over all first-order-set-definable set objects, AMS is a finite second-order axiom that quantifies over all first-order-set-definable set theories. It can then be proven that AMS is Ω + -consistent with an Ω + -complete meta-theory T M and that Ord T M equals Ω .
Potentialism in set theory will not be entirely abandoned by this absolutist philosophy. It remains viable for those who reject AMS or second-order quantification over theories. 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.7 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
AME The axiom of maximal expressivity
AMS The axiom of maximal strength
CH The Continuum Hypothesis
MK Morse–Kelley class theory
NBG von Neumann–Bernays–Gödel set theory
Ord The class of all set ordinals
ZFC Zermelo–Fraenkel set theory with the axiom of choice

References

  1. Barwise, J. Infinitary Logic and Admissible Sets. Ph.D. Thesis, Stanford University, 1967. [Google Scholar]
  2. Blondé, W. Proving predeterminism, or why actuality is certainly actual. Symposion 2024, 11(2), 141–158. [Google Scholar] [CrossRef]
  3. Blondé, W. God as absolute machine: aligning modern formalisms to prove God. Forum Philos. 2025, 30(2), 65–86. [Google Scholar] [CrossRef]
  4. Brauer, E.; Linnebo, Ø.; Shapiro, S. Divergent potentialism: a modal analysis with an application to choice sequences. Philos. Math. 2022, 30(2), 143–172. [Google Scholar] [CrossRef]
  5. Burali-Forti, C. Una questione sui numeri transfiniti. Rend. Del Circ. Mat. Di Palermo (1884-1940) 1897, 11(1), 154–164. [Google Scholar] [CrossRef]
  6. Burgin, M. Inaccessible Information and the Mathematical theory of Oracles. Inf. Stud. Quest. Transdiscipl. Unity Through Divers. 2017, 59–114. [Google Scholar] [CrossRef]
  7. Cantor, G. Gesammelte Abhandlungen, ed. E.; Zermelo, Ed.; Georg Olms Verlagsbuchhandlung: Hildesheim, 1962; pp. 443–447. [Google Scholar] [CrossRef]
  8. Dickmann, M. A. Large Infinitary Languages: Model Theory; North-Holland Publishing Company, 1975. [Google Scholar]
  9. Gödel, K. Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I. Monatshefte Für Math. Und Phys. 1931, 38, 173–198. [Google Scholar] [CrossRef]
  10. Gorbow, P. K.; Leigh, G. E. The Copernican Multiverse of Sets. Rev. Symb. Log. 2022, 15(4), 1033–1069. [Google Scholar] [CrossRef]
  11. Gutschmidt, R.; Carl, M. The negative theology of absolute infinity: Cantor, mathematics, and humility. Int. J. Philos. Relig. 2024, 1–24. [Google Scholar] [CrossRef]
  12. Hamkins, J. D.; Lewis, A. Infinite time Turing machines. J. Symb. Log. 2000, 65(2), 567–604. [Google Scholar] [CrossRef]
  13. Hamkins, J. D. The set-theoretic multiverse. Rev. Symb. Log. 2012, 5(3), 416–449. [Google Scholar] [CrossRef]
  14. Hellman, G.; Shapiro, S. Mathematical structuralism; Cambridge University Press, 2018. [Google Scholar] [CrossRef]
  15. Heylen, J. Factive knowability and the problem of possible omniscience. Philos. Stud. 2020, 177, 65–87. [Google Scholar] [CrossRef]
  16. Karp, C. Languages with Expressions of Infinite Length; North-Holland: Amsterdam, 1964. [Google Scholar]
  17. Koepke, P. Turing computations on ordinals. Bull. Symb. Log. 2005, 11(3), 377–397. [Google Scholar] [CrossRef]
  18. Kunen, K. Set theory; Elsevier, 1980. [Google Scholar]
  19. Lewis, D. K. On the plurality of worlds; Blackwell: Oxford, 1986. [Google Scholar]
  20. Linnebo, Ø. The potential hierarchy of sets. Rev. Symb. Log. 2013, 6(2), 205–228. [Google Scholar] [CrossRef]
  21. Linnebo, Ø.; Shapiro, S. Actual and potential infinity. Noûs 2019, 53(1), 160–191. [Google Scholar] [CrossRef]
  22. Livadas, S. Why is Cantor’s Absolute Inherently Inaccessible? Axiomathes 2020, 30(5), 549–576. [Google Scholar] [CrossRef]
  23. Meadows, T. Two arguments against the generic multiverse. Rev. Symb. Log. 2021, 14(2), 347–379. [Google Scholar] [CrossRef]
  24. Parsons, C. Mathematics in philosophy; Cornell University Press: Ithaca, New York, 1983. [Google Scholar]
  25. Putnam, H. Mathematics without foundations. J. Philos. 1967, 64(1), 5–22. [Google Scholar] [CrossRef]
  26. Scambler, C. An indeterminate universe of sets. Synthese 2020, 197(2), 545–573. [Google Scholar] [CrossRef]
  27. Steinhart, Eric. Theological Implications of the Simulation Argument. Ars. Disput. 2010, 10(1), 23–37. [Google Scholar] [CrossRef]
  28. Sutto, D. A Taxonomy for Set-Theoretic Potentialism. In Philosophia Mathematica; 2024; Volume nkae016. [Google Scholar] [CrossRef]
  29. Thomas-Bolduc, A. R. Cantor, God, and inconsistent multiplicities. Stud. Log. Gramm. Rhetor. 2016, 44(1), 133–146. [Google Scholar] [CrossRef]
  30. von Neumann, J. Die Axiomatisierung der Mengenlehre. Math. Z. 1928, 27(1), 669–752. [Google Scholar] [CrossRef]
  31. Wang, H. On Zermelo’s and von Neumann’s axioms for set theory. Proc. Natl. Acad. Sci. 1949, 35(3), 150–155. [Google Scholar] [CrossRef]
  32. Welch, P.; Horsten, L. Reflecting on absolute infinity. J. Philos. 2016, 113(2), 89–111. [Google Scholar] [CrossRef]
  33. Woodin, W. H. The continuum hypothesis, the generic-multiverse of sets, and the Ω conjecture. Set. Theory Arith. Found. Math. Theorems Philos. 2011, 36, 13–42. [Google Scholar] [CrossRef]
  34. Zermelo, E. Untersuchungen über die Grundlagen der Mengenlehre. I. Math. Ann. 1908, 65(2), 261–281. [Google Scholar] [CrossRef]
  35. Zermelo, E. Über Grenzzahlen und Mengenbereiche: Neue Untersuchungen über die Grundlagen der Mengenlehre. Fundam. Math. 16 1930, 29–47. [Google Scholar] [CrossRef]
1
Not to be confused with Woodin’s ([33]) Ω -logic or related uses of Ω in the large cardinal literature.
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
In infinitary logic, the notation L κ , λ represents an extension of finitary first-order logic ( L ω , ω ), where the number of formulas that can be combined by conjunctions and disjunctions must be strictly less than κ and the number of variables that can be bound by a sequence of quantifiers must be strictly less than λ . Here, κ ≥ λ ≥ ω . Because the proposed proper class cardinal Ω is strictly greater than any set cardinal, L ∞ , ∞ can also be written as L Ω , Ω .
4
Not to be confused with Woodin’s Ω -logic.
5
This terminological solution is needed because first-order logic is often standardly considered to be finitary.
6
Again, not to be confused with Woodin’s Ω -logic.
7
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.