New Foundations
≈ 24 min read
Names in other languages
No names in other languages are held for this entry yet.
Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.
In mathematical logic, New Foundations (NF) is a non-well-founded, finitely axiomatizable set theory conceived by Willard Van Orman Quine as a simplification of the theory of types of Principia Mathematica.
In mathematical logic, New Foundations (NF) is a non-well-founded, finitely axiomatizable set theory conceived by Willard Van Orman Quine as a simplification of the theory of types of Principia Mathematica. The well-formed formulas of NF are the standard formulas of propositional calculus with two primitive predicates equality ( = ) and membership ( \in ). NF can be presented with only two axiom schemata: Extensionality: Two objects with the same elements are the same object; formally, given any set A and any set B, if for every set X, X is a member of A if and only if X is a member of B, then A is equal to B. A restricted axiom schema of comprehension: \{x \mid \phi \} exists for each stratified formula \phi . A formula \phi is said to be stratified if there exists a function f from pieces of \phi 's syntax to the natural numbers, such that for any atomic subformula x \in y of \phi we have f(y) = f(x) + 1, while for any atomic subformula x=y of \phi , we have f(x) = f(y).
Finite axiomatization
NF can be finitely axiomatized. One advantage of such a finite axiomatization is that it eliminates the notion of stratification. The axioms in a finite axiomatization correspond to natural basic constructions, whereas stratified comprehension is powerful but not necessarily intuitive. In his introductory book, Holmes opted to take the finite axiomatization as basic, and prove stratified comprehension as a theorem. The precise set of axioms can vary, but includes most of the following, with the others provable as theorems: Extensionality: If A and B are sets, and for each object x , x is an element of A if and only if x is an element of B , then A = B . This statement can also be viewed as the definition of the equality symbol instead of an axiom. However, in that case another axiom is needed to justify substitution with the equality symbol defined this way. Singleton: For every object x , the set \iota(x) = \{x\} = \{y | y = x\} exists, and is called the singleton of x . Cartesian Product: For any sets A , B , the set A \times B = \{(a, b) | a \in A \text{ and } b \in B\} , called the Cartesian product of A and B , exists. This can be restricted to the existence of one of the cross products A \times V or V \times B . Converse: For each relation R , the set R^{-1} = \{(x, y) | (y,x) \in R\} exists; observe that x R^{-1} y exactly if y R x . Singleton Image: For any relation R , the set R\iota = \{(\{x\}, \{y\}) | (x,y) \in R\} , called the singleton image of R , exists. Domain: If R is a relation, the set \text{dom}(R) = \{x | \exists y. (x,y) \in R\} , called the domain of R , exists. This can be defined using the operation of type lowering. Inclusion: The set [\subseteq] = \{(x, y) | x \subseteq y\} exists. Equivalently, we may consider the set [\in] = [\subseteq] \cap (1 \times V) = \{(\{x\}, y) | x \in y\} . Complement: For each set A , the set A^c = \{x | x \notin A\} , called the complement of A , exists. (Boolean) Union: If A and B are sets, the set A \cup B = \{x | x \in A \text{ or } x \in B \text{ or both}\} , called the (Boolean) union of A and B , exists. Universal Set: V = \{x | x = x\} exists. It is straightforward that for any set x , x \cup x^c = V . Ordered Pair: For each a , b , the ordered pair of a and b , (a, b) , exists; (a, b) = (c, d) exactly if a = c and b = d . This and larger tuples can be a definition rather than an axiom if an ordered pair construction is used. Projections: The sets \pi_1 = \{((x, y), x) | x, y \in V \} and \pi_2 = \{((x, y), y) | x, y \in V \} exist (these are the relations which an ordered pair has to its first and second terms, which are technically referred to as its projections). Diagonal: The set [=] = \{(x, x) | x \in V \} exists, called the equality relation. Set Union: If A is a set all of whose elements are sets, the set \bigcup [A] = \{x | \text{for some } B, x \in B \text{ and } B \in A\} , called the (set) union of A , exists. Relative Product: If R , S are relations, the set (R|S) = \{(x, y) | \text{for some } z, x R z \text{ and } z S y\} , called the relative product of R and S , exists. Anti-intersection: x|y = \{z : \neg(z \in x \land z \in y) \} exists. This is equivalent to complement and union together, with x^c = x|x and x \cup y =x^c|y^c . Cardinal one: The set 1 of all singletons, \{ x | \exists y : (\forall w : w \in x \leftrightarrow w = y) \} , exists. Tuple Insertions: For a relation R , the sets I_2(R) = \{ (z, w, t) : (z, t) \in R \} and I_3(R) = \{ (z, w, t) : (z, w) \in R \} exist. Type lowering: For any set S , the set \text{TL}(S) = \{ z : \forall w : (w, \{z\}) \in S \} exists. Tangled Type Theory (TTT) is an extension of TST where each variable is typed by an ordinal rather than a natural number. The well-formed atomic formulas are x^{n} = y^{n} and x^{m} \in y^{n} where m . The axioms of TTT are those of TST where each variable of type i is mapped to a variable s(i) where s is an increasing function. TTT is considered a "weird" theory because each type is related to each lower type in the same way. For example, type 2 sets have both type 1 members1 and type 0 members, and extensionality axioms assert that a type 2 set is determined uniquely by either its type 1 members or its type 0 members. Whereas TST has natural models where each type i + 1 is the power set of type i , in TTT each type is being interpreted as the power set of each lower type simultaneously. Regardless, a model of NF can be easily converted to a model of TTT, because in NF all the types are already one and the same. Conversely, with a more complicated argument, it can also be shown that the consistency of TTT implies the consistency of NF. \forall x y w. (w \in x) \to (x = y \leftrightarrow (\forall z. z \in x \leftrightarrow z \in y))) In this axiomatization, the comprehension schema is unchanged, although the set \{x \mid \phi(x)\} will not be unique if it is empty (i.e. if \phi(x) is unsatisfiable). However, for ease of use, it is more convenient to have a unique, "canonical" empty set. This can be done by introducing a sethood predicate \mathrm{set}(x) to distinguish sets from atoms. The axioms are then: Sets: Only sets have members, i.e. \forall x y. x \in y \to \mathrm{set}(y). Extensionality: Two sets with the same elements are the same set, i.e. \forall y z. (\mathrm{set}(y) \wedge \mathrm{set}(z) \wedge (\forall x. x \in y \leftrightarrow x \in z)) \to y = z. Comprehension: The set \{x \mid \phi(x) \} exists for each stratified formula \phi(x) , i.e. \exists A. \mathrm{set}(A) \wedge (\forall x. x \in A \leftrightarrow \phi(x)). NF 3 is the fragment of NF with full extensionality (no urelements) and those instances of comprehension which can be stratified using at most three types. NF 4 is the same theory as NF. Mathematical Logic (ML) is an extension of NF that includes proper classes as well as sets. ML was proposed by Quine and revised by Hao Wang, who proved that NF and the revised ML are equiconsistent. Relations and functions are defined in TST (and in NF and NFU) as sets of ordered pairs in the usual way. For purposes of stratification, it is desirable that a relation or function is merely one type higher than the type of the members of its field. This requires defining the ordered pair so that its type is the same as that of its arguments (resulting in a type-level ordered pair). The usual definition of the ordered pair, namely (a, \ b)_K \; := \ \{ \{ a \}, \ \{ a, \ b \} \} , results in a type two higher than the type of its arguments a and b. Hence for purposes of determining stratification, a function is three types higher than the members of its field. NF and related theories usually employ Quine's set-theoretic definition of the ordered pair, which yields a type-level ordered pair. However, Quine's definition relies on set operations on each of the elements a and b, and therefore does not directly work in NFU. As an alternative approach, Holmes takes the ordered pair (a, b) as a primitive notion, as well as its left and right projections \pi_1 and \pi_2 , i.e., functions such that \pi_1((a, b)) = a and \pi_2((a, b)) = b (in Holmes' axiomatization of NFU, the comprehension schema that asserts the existence of \{x \mid \phi \} for any stratified formula \phi is considered a theorem and only proved later, so expressions like \pi_1 = \{((a, b), a) \mid a, b \in V\} are not considered proper definitions). Fortunately, whether the ordered pair is type-level by definition or by assumption (i.e., taken as primitive) usually does not matter. The usual form of the axiom of infinity is based on the von Neumann construction of the natural numbers, which is not suitable for NF, since the description of the successor operation (and many other aspects of von Neumann numerals) is necessarily unstratified. The usual form of natural numbers used in NF follows Frege's definition, i.e., the natural number n is represented by the set of all sets with n elements. Under this definition, 0 is easily defined as \{\varnothing\} , and the successor operation can be defined in a stratified way: S(A) = \{a \cup \{x\} \mid a \in A \wedge x \notin a\}. Under this definition, one can write down a statement analogous to the usual form of the axiom of infinity. However, that statement would be trivially true, since the universal set V would be an inductive set. Since inductive sets always exist, the set of natural numbers \mathbf{N} can be defined as the intersection of all inductive sets. This definition enables mathematical induction for stratified statements P(n) , because the set \{n \in \mathbf{N} \mid P(n)\} can be constructed, and when P(n) satisfies the conditions for mathematical induction, this set is an inductive set. Finite sets can then be defined as sets that belong to a natural number. However, it is not trivial to prove that V is not a "finite set", i.e., that the size of the universe |V| is not a natural number. Suppose that |V| = n \in \mathbf{N} . Then n = \{V\} (it can be shown inductively that a finite set is not equinumerous with any of its proper subsets), n + 1 = S(n) = \varnothing , and each subsequent natural number would be \varnothing too, causing arithmetic to break down. To prevent this, one can introduce the axiom of infinity for NF: \varnothing \notin \mathbf{N}. It may intuitively seem that one should be able to prove Infinity in NF(U) by constructing any "externally" infinite sequence of sets, such as \varnothing, \{\varnothing\}, \{\{{\varnothing}\}\}, \ldots . However, such a sequence could only be constructed through unstratified constructions (evidenced by the fact that TST itself has finite models), so such a proof could not be carried out in NF(U). In fact, Infinity is logically independent of NFU: There exists models of NFU where |V| is a non-standard natural number. In such models, mathematical induction can prove statements about |V| , making it impossible to "distinguish" |V| from standard natural numbers. However, there are some cases where Infinity can be proven (in which cases it may be referred to as the theorem of infinity): In NF (without urelements), Specker has shown that the axiom of choice is false. Since it can be proved through induction that every finite set has a choice function (a stratified condition), it follows that V is infinite. In NFU with axioms asserting the existence of a type-level ordered pair, V is equinumerous with its proper subset V \times \{0\} , which implies Infinity. Conversely, NFU + Infinity + Choice proves the existence of a type-level ordered pair. NFU + Infinity interprets NFU + "there is a type-level ordered pair" (they are not quite the same theory, but the differences are inessential). Stronger axioms of infinity exist, such as that the set of natural numbers is a strongly Cantorian set, or NFUM = NFU + Infinity + Large Ordinals + Small Ordinals which is equivalent to Morse–Kelley set theory plus a predicate on proper classes which is a κ-complete nonprincipal ultrafilter on the proper class ordinal κ. The universal set V. Because x=x is a stratified formula, the universal set V = {x | x=x} exists by Comprehension. An immediate consequence is that all sets have complements, and the entire set-theoretic universe under NF has a Boolean structure. Cardinal and ordinal numbers. In NF (and TST), the set of all sets having n elements (the circularity here is only apparent) exists. Hence Frege's definition of the cardinal numbers works in NF and NFU: a cardinal number is an equivalence class of sets under the relation of equinumerosity: the sets A and B are equinumerous if there exists a bijection between them, in which case we write A \sim B . Likewise, an ordinal number is an equivalence class of well-ordered sets. Cantor's paradox boils down to the question of whether there exists a largest cardinal number, or equivalently, whether there exists a set with the largest cardinality. In NF, the universal set V is obviously a set with the largest cardinality. However, Cantor's theorem says (given ZFC) that the power set P(A) of any set A is larger than A (there can be no injection (one-to-one map) from P(A) into A ), which seems to imply a contradiction when A = V . Of course there is an injection from P(V) into V since V is the universal set, so it must be that Cantor's theorem (in its original form) does not hold in NF. Indeed, the proof of Cantor's theorem uses the diagonalization argument by considering the set B = \{x \in A \mid x \notin f(x)\} . In NF, x and f(x) should be assigned the same type, so the definition of B is not stratified. Indeed, if f: P(V) \to V is the trivial injection x \mapsto x , then B is the same (ill-defined) set in Russell's paradox. This failure is not surprising since |A| makes no sense in TST: the type of P(A) is one higher than the type of A . In NF, |A| is a syntactical sentence due to the conflation of all the types, but any general proof involving Comprehension is unlikely to work. The usual way to correct such a type problem is to replace A with P_1(A) , the set of one-element subsets of A . Indeed, the correctly typed version of Cantor's theorem |P_1(A)| is a theorem in TST (thanks to the diagonalization argument), and thus also a theorem in NF. In particular, |P_1(V)| : there are fewer one-element sets than sets (and so fewer one-element sets than general objects, if we are in NFU). The "obvious" bijection x \mapsto \{x\} from the universe to the one-element sets is not a set; it is not a set because its definition is unstratified. Note that in all models of NFU + Choice it is the case that |P_1(V)| ; Choice allows one not only to prove that there are urelements but that there are many cardinals between |P(V)| and |V| . However, unlike in TST, |A| = |P_1(A)| is a syntactical sentence in NF(U), and as shown above one can talk about its truth value for specific values of A (e.g. when A = V it is false). A set A which satisfies the intuitively appealing |A| = |P_1(A)| is said to be Cantorian: a Cantorian set satisfies the usual form of Cantor's theorem. A set A which satisfies the further condition that (x \mapsto \{x\})\lceil A , the restriction of the singleton map to A, is a set is not only Cantorian set but strongly Cantorian.
Burali-Forti paradox and the T operation
The Burali-Forti paradox of the largest ordinal number is resolved in the opposite way: In NF, having access to the set of ordinals does not allow one to construct a "largest ordinal number". One can construct the ordinal \Omega that corresponds to the natural well-ordering of all ordinals, but that does not mean that \Omega is larger than all those ordinals. To formalize the Burali-Forti paradox in NF, it is necessary to first formalize the concept of ordinal numbers. In NF, ordinals are defined (in the same way as in naive set theory) as equivalence classes of well-orderings under isomorphism. This is a stratified definition, so the set of ordinals \mathrm{Ord} can be defined with no problem. Transfinite induction works on stratified statements, which allows one to prove that the natural ordering of ordinals ( \alpha \le \beta iff there exists well-orderings R \in \alpha, S \in \beta such that S is a continuation of R ) is a well-ordering of \mathrm{Ord} . By definition of ordinals, this well-ordering also belongs to an ordinal \Omega \in \mathrm{Ord} . In naive set theory, one would go on to prove by transfinite induction that each ordinal \alpha is the order type of the natural order on the ordinals less than \alpha , which would imply an contradiction since \Omega by definition is the order type of all ordinals, not any proper initial segment of them. However, the statement " \alpha is the order type of the natural order on the ordinals less than \alpha " is not stratified, so the transfinite induction argument does not work in NF. In fact, "the order type \beta of the natural order R_\alpha on the ordinals less than \alpha " is at least two types higher than \alpha : The order relation R_\alpha = \{(x, y) \mid x \le y is one type higher than \alpha assuming that (x, y) is a type-level ordered pair, and the order type (equivalence class) \beta = \{S \mid S \sim R_\alpha\} is one type higher than R_\alpha . If (x, y) is the usual Kuratowski ordered pair (two types higher than x and y ), then \beta would be four types higher than \alpha . To correct such a type problem, one needs the T operation, T(\alpha) , that "raises the type" of an ordinal \alpha , just like how P_1(A) "raises the type" of the set A . The T operation is defined as follows: If W \in \alpha , then T(\alpha) is the order type of the order W^{\iota} = \{(\{x\},\{y\}) \mid xWy\} . Now the lemma on order types may be restated in a stratified manner: The order type of the natural order on the ordinals is T^2(\alpha) or T^4(\alpha) , depending on which ordered pair is used. Both versions of this statement can be proven by transfinite induction; we assume the type level pair hereinafter. This means that T^2(\alpha) is always less than \Omega , the order type of all ordinals. In particular, T^2(\Omega) . Another (stratified) statement that can be proven by transfinite induction is that T is a strictly monotone (order-preserving) operation on the ordinals, i.e., T(\alpha) iff \alpha . Hence the T operation is not a function: The collection of ordinals \{\alpha \mid T(\alpha) cannot have a least member, and thus cannot be a set. More concretely, the monotonicity of T implies \Omega > T^2(\Omega) > T^4(\Omega)\ldots , a "descending sequence" in the ordinals which also cannot be a set. One might assert that this result shows that no model of NF(U) is "standard", since the ordinals in any model of NFU are externally not well-ordered. This is a philosophical question, not a question of what can be proved within the formal theory. Note that even within NFU it can be proven that any set model of NFU has non-well-ordered "ordinals"; NFU does not conclude that the universe V is a model of NFU, despite V being a set, because the membership relation is not a set relation. In fact, j is coded by a function in the model of NFU. The function in the nonstandard model which sends the singleton of any element of V_{j(\alpha)} to its sole element, becomes in NFU a function which sends each singleton {x}, where x is any object in the universe, to j(x). Call this function Endo and let it have the following properties: Endo is an injection from the set of singletons into the set of sets, with the property that Endo( {x} ) = {Endo( {y} ) | y∈x} for each set x. This function can define a type level "membership" relation on the universe, one reproducing the membership relation of the original nonstandard model. \mathsf{DC}(\alpha) is defined as follows: Let S be a nonempty set and let R be a binary relation such that for every \alpha -sequence s = \langle x_\gamma : \gamma of elements of S there exists y \in S such that sRy . Then there is a function f such that for every \gamma . This axiom is a strengthening of the standard Axiom of dependent choice because it guarantees the existence of a complete choice sequence of length \alpha , where each step in the sequence is a valid choice based on all previous selections. \mathsf{NF}+V is linearly ordered, There is currently no proof of its consistency. \mathsf{NF+PIT} see Boolean prime ideal theorem. There is currently no proof of its consistency. \mathsf{NF}+\mathcal{L}_{\omega_1,\omega}(\omega) is \mathsf{NF} + comprehension for stratified formules of the language \mathcal{L}_{\omega_1,\omega} using only finitely many types. Its model are exactly the models for which the NF set \mathbb{N}\land\mathcal{P}(\mathbb{N}) are the real external ones. \mathsf{NFUR} axiomatized as \mathsf{NFU+Inf}+\mathbb{N}\mathsf{\ is \ SC} . \mathsf{NFU*} axiomatized as \mathsf{NFU+SCS}+\mathbb{N}\mathsf{\ is \ SC} . \mathsf{NFUA} axiomatized as \mathsf{NFU+Inf}+\mathsf{C\ is \ SC} . \mathsf{NFUB} axiomatized as \mathsf{NFUA+SO} . \mathsf{NFUB}^- axiomatized as \mathsf{NFU+Inf}+\mathsf{C\ is \ SC}+\mathsf{SO} . \mathsf{NFUM} axiomatized as \mathsf{NFUB}^-+\mathsf{LO} . \mathsf{NFU}^{-\infty} axiomatized as \mathsf{NFU}+V is finite. \mathsf{NFUA}^{-\infty} axiomatized as \mathsf{NFU}^{-\infty}+\mathsf{C\ is \ SC} . \mathsf{NFUB}^{-\infty} axiomatized as \mathsf{NFUA}^{-\infty}+\mathsf{SO} . The axioms listed below are higher infinite axioms specific to NF-style set theory, and they also apply to NF-style type theory. When used individually, they are not necessarily very strong in the traditional sense (such as \trianglerighteq \text{Con}(\textsf{ZFC}) ), but when used in combination, they are indeed very strong. NF-style higher infinite \mathbb{N}\mathsf{\ is \ SC} or \mathsf{Count} is Rosser's Axiom of Counting, which asserts that the set of natural numbers is a strongly Cantorian set. \mathsf{SCS} is Axiom of strongly Cantorian separation, which asserts that for any strongly Cantorian set A and any formula \phi (not necessarily stratified) the set \{x\in A|\;\phi\} exists. \mathsf{C\ is\ SC} is Axiom of Cantorian Sets, which asserts that Every Cantorian set is strongly Cantorian. \mathsf{LO} is Axiom of Large Ordinals, which asserts that for each non-Cantorian ordinal \alpha , there is a natural number n such that T^n(\Omega) . \mathsf{SO} is Axiom of Small Ordinals, which asserts that for any formula \phi (not necessarily stratified), there is a set A such that the elements of A which are strongly Cantorian ordinals are exactly the strongly Cantorian ordinals such that \phi . ZF-style set theory \mathsf{MAC} see Mac Lane set theory. \mathsf{MACQ} as \mathsf{MAC} with foundation weakened to allow Quine atoms and an axiom scheme asserting the existence of an n-tree of cardinals for each concrete natural number n. A tangled web of cardinals is a tangled web of cardinals of order \tau . For any infinite ordinal \alpha , a tangled web of cardinals of order \alpha is a function \tau from the set of nonempty sets of ordinals with \alpha as maximum to cardinals such that If |A| > 1,\tau(A_1)=2^{\tau(A)} . If |A| \leq n , the first order theory of a natural model of \mathsf{TST}_n with base type \tau(A) is completely determined by A \backslash A_n , the n smallest elements of A . \mathsf{Z}^- see Zermelo set theory. \mathsf{ZFC} see Zermelo–Fraenkel set theory. \mathsf{NBG} see Von Neumann–Bernays–Gödel set theory. \mathsf{MK} see Morse–Kelley set theory. \mathsf{MKU} axiomatized as \mathsf{MK}+ "there is a \kappa -complete nonprincipal ultrafilter on the proper class ordinal \kappa ". Higher infinite N-\mathsf{Mahlo} is a schema asserting the existence of an n-Mahlo cardinal for each concrete natural number n, and doesn't prove that n-Mahlo cardinals exist forall n, thus allowing for nonstandard counterexamples. \mathsf{weakly\ compact} see weakly compact cardinal. \mathsf{measurable} see measurable cardinal. Type-style theory \mathsf{FlatOP} see New Foundations#Ordered pairs, is Axiom of type-level ordered pair, which can also be called flat ordered pair. In models without the Axiom of Choice \mathsf{AC} , the existence of a type-level ordered pair implies but is not equivalent to the existence of an infinite set, but NFU with the axiom "there is an infinite set" interprets NFU with a type-level pair in a straightforward manner. It's well-known that proofs concerning like \alpha -strong cardinals run into problems if one doesn't use the flat ordered pair, and this is no different from ZF-style set theory. \mathsf{Amb} is typical ambiguity axiom, which asserts that validity for closed predicates is invariant under shifts of type levels. \mathsf{TSTI} or \mathsf{TTI} is a subsystem of \mathsf{TST} , axiomatized as unrestricted extensionality and those instances of comprehension in which no variable is assigned a type higher than that of the set asserted to exist. \mathsf{TSTP} or \mathsf{TTP} is a subsystem of \mathsf{TST} like \mathsf{TSTI} , in which only free variables are allowed to have the type of the set asserted to exist by an instance of comprehension. \mathsf{RTT} axiomatized as Principia Mathematica ramified type theory without the axiom of reducibility. \mathsf{TTU} is \mathsf{TTT} with urelements, and \mathsf{NFU} is untyped \mathsf{TTU} . \mathsf{TSTU} is \mathsf{TST} with urelements, and \mathsf{NFU} is untyped \mathsf{TSTU} . \mathsf{T}\mathbb{Z}\mathsf{T} is Simple theory of types with all integer types, it has a realizability model and computational interpretation and is therefore consistent, and \mathsf{iNF} is untyped \mathsf{T}\mathbb{Z}\mathsf{T} . \mathsf{TTT} see New Foundations#Tangled Type Theory. \mathsf{NF} is untyped \mathsf{TTT} . \mathsf{TST} or \mathsf{TT} see New Foundations#Typed Set Theory. \mathsf{NF} is untyped \mathsf{TTT} . \mathsf{TST}_k is \mathsf{TST} restricted to levels 0 to k − 1, forall k > 2. \mathsf{TST}^\infty_k is \mathsf{TST}_k+ "level 0 contains ≥ n things for every concrete n." \mathsf{TST}^\infty_3 is \mathsf{TST}^\infty_k restricted to k = 3. Higher-order arithmetic \mathsf{I\Delta_0 + exp} is arithmetic with induction restricted to Δ0-predicates without any axiom asserting that exponentiation is total. \mathsf{EFA} see elementary function arithmetic. \mathsf{PA} see Peano arithmetic. \mathsf{Z}_2 see Second-order arithmetic.
See also
Alternative set theory Axiomatic set theory Implementation of mathematics in set theory Positive set theory Set-theoretic definition of natural numbers
Text derived from https://en.wikipedia.org/w/index.php?oldid=1367620620 under CC BY-SA 4.0; modifications have been made.
References
- ↩Wikipedia “New Foundations” members (×1) · confidence 0.95 revision URL