In mathematical logic, New Foundations (NF) is an axiomatic set theory, conceived by Willard Van Orman Quine as a simplification of the theory of types of Principia Mathematica. Mathematical logic is a subfield of Logic and Mathematics with close connections to Computer science and Philosophical logic. Willard Van Orman Quine (June 25 1908 Akron, Ohio &ndash December 25 2000 (known to intimates as "Van" In Mathematics, Logic and Computer science, type theory is any of several Formal systems that can serve as alternatives to Naive set theory The Principia Mathematica is a 3-volume work on the Foundations of mathematics, written by Alfred North Whitehead and Bertrand Russell Quine first proposed NF in a 1937 article titled "New Foundations for Mathematical Logic"; hence the name. Much of this entry discusses NFU, an important variant of NF due to Jensen (1969) and exposited in Holmes (1998).

The type theory TST

The primitive predicates of TST, a streamlined version of the theory of types, are equality and membership. In Mathematics, Logic and Computer science, type theory is any of several Formal systems that can serve as alternatives to Naive set theory TST has a linear hierarchy of types: type 0 consists of individuals otherwise undescribed. For each (meta-) natural number n, type n+1 objects are sets of type n objects; sets of type n have members of type n-1. Objects connected by identity must have the same type. The following two atomic formulas succinctly describe the typing rules: $x^{n} = y^{n}\!$ and $x^{n} \in y^{n+1}$ (notation to be improved).

The axioms of TST are:

• Extensionality: sets of the same (positive) type with the same members are equal;
• An axiom schema of comprehension, namely:
If $\phi(x^n)\!$ is a formula, then the set $\{x^n \mid \phi(x^n)\}^{n+1}\!$ exists. In Axiomatic set theory and the branches of Logic, Mathematics, and Computer science that use it the axiom of extensionality, or axiom In Axiomatic set theory and the branches of Logic, Mathematics, and Computer science that use it the axiom schema of specification, axiom In Mathematical logic, a well-formed formula (often abbreviated WFF, pronounced "wiff" or "wuff" is a Symbol or string of symbols (a
In other words, given any formula $\phi(x^n)\!$, the formula $\exists A^{n+1} \forall x^n [x^n \in A^{n+1} \leftrightarrow \phi(x^n)]$ is an axiom where $A^{n+1}\!$ represents the set $\{x^n \mid \phi(x^n)\}^{n+1}\!$.

This type theory is much less complicated than the one first set out in the Principia Mathematica, which included types for relations whose arguments were not necessarily all of the same type. The Principia Mathematica is a 3-volume work on the Foundations of mathematics, written by Alfred North Whitehead and Bertrand Russell In 1914, Norbert Wiener showed how to code the ordered pair as a set of sets, making it possible to eliminate relation types in favor of the linear hierarchy of sets described here. Norbert Wiener ( November 26, 1894, Columbia Missouri – March 18, 1964, Stockholm, Sweden) was an American In Mathematics, an ordered pair is a collection of two distinguishable objects one of which is identified as the first coordinate (or the first entry

Quinian set theory

Axioms and stratification

New Foundations (NF) is obtained from TST by abandoning the distinctions of type. The axioms of NF are:

• Extensionality: Two objects with the same elements are the same object;
• A comprehension schema: All instances of TST Comprehension but with type indices dropped (and without introducing new identifications between variables). In Logic, extensionality refers to principles that judge objects to be equal if they have the same external properties In Axiomatic set theory and the branches of Logic, Mathematics, and Computer science that use it the axiom schema of specification, axiom

By convention, NF's Comprehension schema is stated using the concept of stratified formula and making no direct reference to types. In Axiomatic set theory and the branches of Logic, Mathematics, and Computer science that use it the axiom schema of specification, axiom Stratification has several usages in mathematics In mathematical logic In Mathematical logic, stratification is any consistent assignment of numbers A formula φ is said to be stratified if there exists a function f from pieces of syntax to the natural numbers, such that for any atomic subformula $x \in y$ of φ we have f(y) = f(x) + 1, while for any atomic subformula x = y of φ, we have f(x) = f(y). Stratification has several usages in mathematics In mathematical logic In Mathematical logic, stratification is any consistent assignment of numbers The Mathematical concept of a function expresses dependence between two quantities one of which is given (the independent variable, argument of the function Comprehension then becomes:

$\{x \mid \phi \}$ exists for each stratified formula φ. Stratification has several usages in mathematics In mathematical logic In Mathematical logic, stratification is any consistent assignment of numbers

Even the indirect reference to types implicit in the notion of stratification can be eliminated. Stratification has several usages in mathematics In mathematical logic In Mathematical logic, stratification is any consistent assignment of numbers Theodore Hailperin showed in 1944 that Comprehension is equivalent to a finite conjunction of its instances,[1] so that NF can be finitely axiomatized without any reference to the notion of type.

Comprehension may seem inconsistent with naive set theory, but this is not the case. Naive set theory is one of several theories of sets used in the discussion of the Foundations of mathematics. For example, the impossible Russell class $\{x \mid x \not\in x\}$ is not an NF set, because $x \not\in x$ cannot be stratified. Part of the Foundations of mathematics, Russell's paradox (also known as Russell's antinomy) discovered by Bertrand Russell in 1901 showed that the

Ordered pairs

Relations and functions are defined in TST (and in NF and NFU) as sets of ordered pairs in the usual way. The Mathematical concept of a function expresses dependence between two quantities one of which is given (the independent variable, argument of the function In Mathematics, an ordered pair is a collection of two distinguishable objects one of which is identified as the first coordinate (or the first entry The usual definition of the ordered pair, first proposed by Kuratowski in 1921, has a serious drawback for NF and related theories: the resulting ordered pair necessarily has a type two higher than the type of its arguments (its left and right projections). Kazimierz Kuratowski ( Warsaw, February 2, 1896 &ndash June 18, 1980) was a Polish Mathematician and Logician Hence for purposes of determining stratification, a function is three types higher than the members of its field.

If one can define a pair in such a way that its type is the same type as that of its arguments (resulting in a type-level ordered pair), then a relation or function is merely one type higher than the type of the members of its field. Hence NF and related theories usually employ Quine's set-theoretic definition of the ordered pair, which yields a type-level ordered pair. Willard Van Orman Quine (June 25 1908 Akron, Ohio &ndash December 25 2000 (known to intimates as "Van" Holmes (1998) takes the ordered pair and its left and right projections as primitive. Fortunately, whether the ordered pair is type-level by definition or by assumption (i. e. , taken as primitive) usually does not matter.

The existence of a type-level ordered pair implies Infinity, and NFU + Infinity interprets NFU + "there is a type level ordered pair" (they are not quite the same theory, but the differences are inessential). Conversely, NFU + Infinity + Choice proves the existence of a type-level ordered pair.

Admissibility of useful large sets

NF (and NFU + Infinity + Choice, described below and known consistent) allow the construction of two kinds of sets that ZFC and its proper extensions disallow because they are "too large" (some set theories admit these entities under the heading of proper classes):

• The universal set V. Zermelo–Fraenkel set theory with the axiom of choice, commonly abbreviated ZFC, is the standard form of Axiomatic set theory and as such is the most common In Set theory and its applications throughout Mathematics, a class is a collection of sets (or sometimes other mathematical objects that can be unambiguously In Set theory, a universal set is a set which contains all objects including itself Because x = x is a stratified formula, the universal set V = {x | x=x} exists by Comprehension. Stratification has several usages in mathematics In mathematical logic In Mathematical logic, stratification is any consistent assignment of numbers In Set theory, a universal set is a set which contains all objects including itself An immediate consequence is that all sets have complements, and the entire set-theoretic universe under NF has a Boolean structure. In Abstract algebra, a Boolean algebra or Boolean lattice is a complemented distributive lattice.
• Cardinal and ordinal numbers. In NF (and TST), the set of all sets having n elements (the circularity here is only apparent) exists. In Logic, begging the question has traditionally described a type of Logical fallacy (also called petitio principii) in which the proposition 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$. Friedrich Ludwig Gottlob Frege ( 8 November 1848, Wismar, Grand Duchy of Mecklenburg-Schwerin  &ndash 26 July 1925 This article describes cardinal numbers in mathematics For cardinals in linguistics see Names of numbers in English. In Mathematics, given a set X and an Equivalence relation ~ on X, the equivalence class of an element a in X In the field of Mathematics, two sets A and B are equinumerous if they have the same Cardinality, i In Mathematics, a bijection, or a bijective function is a function f from a set X to a set Y with the property Likewise, an ordinal number is an equivalence class of well-ordered sets under the relation of similarity. In Set theory, an ordinal number, or just ordinal, is the Order type of a Well-ordered set. In Mathematics, given a set X and an Equivalence relation ~ on X, the equivalence class of an element a in X In Mathematics, a well-order relation (or well-ordering) on a set S is a Total order on S with the property that every

The consistency problem and related partial results

The outstanding problem with NF is that it is not known to be relatively consistent to anything. In Mathematics, specifically in Mathematical logic, formal theories are studied as Mathematical objects Since some theories are powerful enough to model NF disproves Choice, and so proves Infinity (Specker, 1953). But it is also known (Jensen, 1969) that the minor(?) modification of allowing urelements (objects lacking members which are distinct from the empty set and from one another) yields NFU, a theory that is consistent relative to Peano arithmetic, with and without added Infinity and Choice. Ronald Björn Jensen (born April 1 1936 is an American mathematician active in Europe primarily known for his work in Mathematical logic and Set theory In Set theory, a branch of Mathematics, an urelement or ur-element (from the German prefix ur-, 'primordial' is an object (concrete In Mathematical logic, the Peano axioms, also known as the Dedekind-Peano axioms or the Peano postulates, are a set of Axioms for the Natural (NFU corresponds to a type theory TSTU, where positive types may contain urelements. ) There are other consistent variants of NF.

NFU is, roughly speaking, weaker than NF because in NF, the power set of the universe is the universe itself, while in NFU, the power set of the universe is strictly smaller than the universe (the power set of the universe contains only one empty set, while in NFU the universe is assumed to contain more than one distinct empty set).

Specker has shown that NF is equiconsistent with TST + Amb, where Amb is the axiom scheme of typical ambiguity which asserts $\phi \leftrightarrow \phi^+$ for any formula φ, φ + being the formula obtained by raising every type index in φ by one. In Mathematics, specifically in Mathematical logic, formal theories are studied as Mathematical objects Since some theories are powerful enough to model NF is also equiconsistent with the theory TST augmented with a "type shifting automorphism", an operation which raises type by one, mapping each type onto the next higher type, and preserves equality and membership relations (and which cannot be used in instances of Comprehension: it is external to the theory). The same results hold for various fragments of TST in relation to the corresponding fragments of NF.

In the same year (1969) that Jensen proved NFU consistent, Grishin proved NF3 consistent. Ronald Björn Jensen (born April 1 1936 is an American mathematician active in Europe primarily known for his work in Mathematical logic and Set theory NF3 is the fragment of NF with full extensionality (no urelements) and those instances of Comprehension which can be stratified using just three types. This theory is a very awkward medium for mathematics (although there have been attempts to alleviate this awkwardness), largely because there is no obvious definition for an ordered pair. In Mathematics, an ordered pair is a collection of two distinguishable objects one of which is identified as the first coordinate (or the first entry Despite this awkwardness, NF3 is very interesting because every infinite model of TST restricted to three types satisfies Amb. Hence for every such model there is a model of NF3 with the same theory. This does not hold for four types: NF4 is the same theory as NF, and we have no idea how to obtain a model of TST with four types in which Amb holds.

In 1983, Marcel Crabbé proved consistent a system he called NFI, whose axioms are unrestricted extensionality and those instances of Comprehension in which no variable is assigned a type higher than that of the set asserted to exist. This is a predicativity restriction, though NFI is not a predicative theory: it admits enough impredicativity to define the set of natural numbers (defined as the intersection of all inductive sets; note that the inductive sets quantified over are of the same type as the set of natural numbers being defined). In Mathematics and Logic, impredicativity is the property of a self-referencing Definition. Crabbé also discussed a subtheory of NFI, in which only parameters (free variables) are allowed to have the type of the set asserted to exist by an instance of Comprehension. He called the result "predicative NF" (NFP); it is, of course, doubtful whether any theory with a self-membered universe is truly predicative. Holmes has <date?> shown that NFP has the same consistency strength as the predicative theory of types of Principia Mathematica without the Axiom of Reducibility. The Principia Mathematica is a 3-volume work on the Foundations of mathematics, written by Alfred North Whitehead and Bertrand Russell In Computability theory and Computational complexity theory, a reduction is a transformation of one problem into another problem

How NF(U) avoids the set-theoretic paradoxes

NF steers clear of the three well-known paradoxes of set theory. A paradox is a true statement or group of statements that leads to a Contradiction or a situation which defies intuition; or inversely That NFU, a {relatively} consistent theory, also avoid the paradoxes increases our confidence in this fact.

The Russell paradox: An easy matter; $x \not\in x$ is not a stratified formula, so the existence of $\{x \mid x \not\in x\}$ is not asserted by any instance of Comprehension. Part of the Foundations of mathematics, Russell's paradox (also known as Russell's antinomy) discovered by Bertrand Russell in 1901 showed that the Quine presumably constructed NF with this paradox uppermost in mind.

Cantor's paradox of the largest cardinal number exploits the application of Cantor's theorem to the universal set. In Set theory, Cantor's paradox is the Theorem that there is no greatest Cardinal number, so that the collection of "infinite sizes" is itself This article describes cardinal numbers in mathematics For cardinals in linguistics see Names of numbers in English. Note in order to fully understand this article you may want to refer to the Set theory portion of the Table of mathematical symbols. In Set theory, a universal set is a set which contains all objects including itself 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). Note in order to fully understand this article you may want to refer to the Set theory portion of the Table of mathematical symbols. Zermelo–Fraenkel set theory with the axiom of choice, commonly abbreviated ZFC, is the standard form of Axiomatic set theory and as such is the most common In Mathematics, given a set S, the power set (or powerset) of S, written \mathcal{P}(S P ( S) Now of course there is an injection from P(V) into V, if V is the universal set! The resolution requires that we observe that | A | < | P(A) | makes no sense in the theory of types: the type of P(A) is one higher than the type of A. The correctly typed version (which is a theorem in the theory of types for essentially the same reasons that the original form of Cantor's theorem works in ZF) is | P1(A) | < | P(A) | , where P1(A) is the set of one-element subsets of A. Note in order to fully understand this article you may want to refer to the Set theory portion of the Table of mathematical symbols. The specific instance of this theorem that interests us is | P1(V) | < | P(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. In Mathematics, a bijection, or a bijective function is a function f from a set X to a set Y with the property Note that in all known models of NFU it is the case that | P1(V) | < | P(V) | < < | V | ; Choice allows one not only to prove that there are urelements but that there are many cardinals between | P(V) | and | V | .

We now introduce some useful notions. A set A which satisfies the intuitively appealing | A | = | P1(A) | is said to be cantorian: a cantorian set satisfies the usual form of Cantor's theorem. Note in order to fully understand this article you may want to refer to the Set theory portion of the Table of mathematical symbols. A set A which satisfies the further condition that $(x \mapsto \{x\})\lceil A$, the restriction of the singleton map to A, is not only cantorian set but strongly cantorian.

The Burali-Forti paradox of the largest ordinal number goes as follows. In Set theory, a field of Mathematics, the Burali-Forti paradox demonstrates that naively constructing "the set of all Ordinal numbers quot leads to In Set theory, an ordinal number, or just ordinal, is the Order type of a Well-ordered set. We define (following naive set theory) the ordinals as equivalence classes of well-orderings under similarity. Naive set theory is one of several theories of sets used in the discussion of the Foundations of mathematics. In Mathematics, given a set X and an Equivalence relation ~ on X, the equivalence class of an element a in X In Mathematics, a well-order relation (or well-ordering) on a set S is a Total order on S with the property that every There is an obvious natural well-ordering on the ordinals; since it is a well-ordering it belongs to an ordinal Ω. It is straightforward to prove (by transfinite induction) that the order type of the natural order on the ordinals less than a given ordinal α is α itself. Transfinite induction is an extension of Mathematical induction to well-ordered sets, for instance to sets of ordinals or cardinals. But this means that Ω is the order type of the ordinals < Ω and so is strictly less than the order type of all the ordinals -- but the latter is, by definition, Ω itself!

The solution to the paradox in NF(U) starts with the observation that the order type of the natural order on the ordinals less than α is of a higher type than α. Hence a type level ordered pair is two, and the usual Kuratowski ordered pair, four, types higher than the type of its arguments. In Mathematics, an ordered pair is a collection of two distinguishable objects one of which is identified as the first coordinate (or the first entry For any order type α, we can define an order type α one type higher: if $W \in \alpha$, then T(α) is the order type of the order $W^{\iota} = \{(\{x\},\{y\}) \mid xWy\}$. The triviality of the T operation is only a seeming one; it is easy to show that T is a strictly monotone (order preserving) operation on the ordinals.

We can now restate the lemma on order types in a stratified manner: the order type of the natural order on the ordinals < α is T2(α) or T4(α) depending on which pair is used (we assume the type level pair hereinafter). From this we deduce that the order type on the ordinals < Ω is T2(Ω), from which we deduce T2(Ω) < Ω. Hence the T operation is not a function; we cannot have a strictly monotone set map from ordinals to ordinals which sends an ordinal downward! Since T is monotone, we have $\Omega > T^2(\Omega) > T^4(\Omega)\ldots$, a "descending sequence" in the ordinals which cannot be a set.

Some have asserted 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. We do not take a position on this, but we note that it is also a theorem of NFU 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.

For a further development of mathematics in NFU, with a comparison to the development of the same in ZFC, see implementation of mathematics in set theory. Zermelo–Fraenkel set theory with the axiom of choice, commonly abbreviated ZFC, is the standard form of Axiomatic set theory and as such is the most common This article examines the implementation of mathematical concepts in Set theory.

The set theory of the 1940 first edition of Quine's Mathematical Logic married NF to the proper classes of NBG set theory, and included an axiom schema of unrestricted comprehension for proper classes. Willard Van Orman Quine (June 25 1908 Akron, Ohio &ndash December 25 2000 (known to intimates as "Van" In Set theory and its applications throughout Mathematics, a class is a collection of sets (or sometimes other mathematical objects that can be unambiguously In the Foundations of mathematics, Von Neumann–Bernays–Gödel set theory ( NBG) is an Axiomatic set theory that is a Conservative extension In 1942, J. Barkley Rosser proved that Quine's set theory was subject to the Burali-Forti paradox. John Barkley Rosser Sr (1907–1989 was an American Logician, a student of Alonzo Church, and known for his part in the Church-Rosser theorem Rosser's proof does not go through for NF(U). In 1950, Hao Wang showed how to amend Quine's axioms so as to avoid this problem, and Quine included the resulting axiomatization in the 1951 second and final edition of Mathematical Logic. Wang Hao, also Hao Wang ( 20 May 1921 &ndash 13 May 1995) was a Chinese American Logician, Philosopher

Models of NFU

There is a fairly simple method for producing models of NFU in bulk. Using well-known techniques of model theory, one can construct a nonstandard model of Zermelo set theory (nothing nearly as strong as full ZFC is needed for the basic technique) on which there is an external automorphism j (not a set of the model) which moves a rank Vα of the cumulative hierarchy of sets. In Mathematics, model theory is the study of (classes of mathematical structures such as groups, Fields graphs or even models Zermelo set theory, as set out in an important paper in 1908 by Ernst Zermelo, is the ancestor of modern Set theory. Zermelo–Fraenkel set theory with the axiom of choice, commonly abbreviated ZFC, is the standard form of Axiomatic set theory and as such is the most common In mathematical Set theory, the rank of a set is defined inductively as the smallest Ordinal number greater than the rank of any member of the set @@@ main@@@ - title Hierarchy@@@ keywords structure; sociology; information@@@ review@@@ - We may suppose without loss of generality that j(α) < α. We talk about the automorphism moving the rank rather than the ordinal because we do not want to assume that every ordinal in the model is the index of a rank. In Mathematics, an automorphism is an Isomorphism from a Mathematical object to itself

The domain of the model of NFU will be the nonstandard rank Vα. The membership relation of the model of NFU will be

• $x \in_{NFU} y \equiv_{def} j(x) \in y \wedge y \in V_{j(\alpha)+1}.$

We now prove that this actually is a model of NFU. Let φ be a stratified formula in the language of NFU. Choose an assignment of types to all variables in the formula which witnesses the fact that it is stratified. Choose a natural number N greater than all types assigned to variables by this stratification.

Expand the formula φ into a formula φ1 in the language of the nonstandard model of Zermelo set theory with automorphism j using the definition of membership in the model of NFU. Zermelo set theory, as set out in an important paper in 1908 by Ernst Zermelo, is the ancestor of modern Set theory. In Mathematics, an automorphism is an Isomorphism from a Mathematical object to itself Application of any power of j to both sides of an equation or membership statement preserves its truth value because j is an automorphism. Make such an application to each atomic formula in φ1 in such a way that each variable x assigned type i occurs with exactly N − i applications of j. In Mathematical logic, an atomic formula (also known simply as an atom) is a formula with no deeper Propositional structure that is a formula This is possible thanks to the form of the atomic membership statements derived from NFU membership statements, and to the formula being stratified. Each quantified sentence $(\forall x \in V_{\alpha}.\psi(j^{N-i}(x)))$ can be converted to the form $(\forall x \in j^{N-i}(V_{\alpha}).\psi(x))$ (and similarly for existential quantifiers). In Predicate logic, an existential quantification is the predication of a property or relation to at least one member of the domain Carry out this transformation everywhere and obtain a formula φ2 in which j is never applied to a bound variable.

Choose any free variable y in φ assigned type i. Apply ji − N uniformly to the entire formula to obtain a formula φ3 in which y appears without any application of j. Now $\{y \in V_{\alpha} \mid \phi_3\}$ exists (because j appears applied only to free variables and constants), belongs to Vα + 1, and contains exactly those y which satisfy the original formula φ in the model of NFU. $j(\{y \in V_{\alpha} \mid \phi_3\})$ has this extension in the model of NFU (the application of j corrects for the different definition of membership in the model of NFU). This establishes that Stratified Comprehension holds in the model of NFU.

To see that weak Extensionality holds is straightforward: each nonempty element of Vj(α) + 1 inherits a unique extension from the nonstandard model, the empty set inherits its usual extension as well, and all other objects are urelements.

The basic idea is that the automorphism j codes the "power set" Vα + 1 of our "universe" Vα into its externally isomorphic copy Vj(α) + 1 inside our "universe. " The remaining objects not coding subsets of the universe are treated as urelements. In Set theory, a branch of Mathematics, an urelement or ur-element (from the German prefix ur-, 'primordial' is an object (concrete

If α is a natural number n, we get a model of NFU which claims that the universe is finite (it is externally infinite, of course). If α is infinite and the Choice holds in the nonstandard model of ZFC, we obtain a model of NFU + Infinity + Choice. In Mathematics, the axiom of choice, or AC, is an Axiom of Set theory. Zermelo–Fraenkel set theory with the axiom of choice, commonly abbreviated ZFC, is the standard form of Axiomatic set theory and as such is the most common

Self-sufficiency of mathematical foundations in NFU

For philosophical reasons, it is important to note that it is not necessary to work in ZFC or any related system to carry out this proof. Zermelo–Fraenkel set theory with the axiom of choice, commonly abbreviated ZFC, is the standard form of Axiomatic set theory and as such is the most common A common argument against the use of NFU as a foundation for mathematics is that our reasons for relying on it have to do with our intuition that ZFC is correct. Zermelo–Fraenkel set theory with the axiom of choice, commonly abbreviated ZFC, is the standard form of Axiomatic set theory and as such is the most common We claim that it is sufficient to accept TST (in fact TSTU). We outline the approach: take the type theory TSTU (allowing urelements in each positive type) as our metatheory and consider the theory of set models of TSTU in TSTU (these models will be sequences of sets Ti (all of the same type in the metatheory) with embeddings of each P(Ti) into P1(Ti + 1) coding embeddings of the power set of Ti into
Ti + 1 in a type-respecting manner). Given an embedding of T0 into T1 (identifying elements of the base "type" with subsets of the base type), one can define embeddings from each "type" into its successor in a natural way. This can be generalized to transfinite sequences Tα with care.

Note that the construction of such sequences of sets is limited by the size of the type in which they are being constructed; this prevents TSTU from proving its own consistency (TSTU + Infinity can prove the consistency of TSTU; to prove the consistency of TSTU+Infinity one needs a type containing a set of cardinality $\beth_{\omega}$, which cannot be proved to exist in TSTU+Infinity without stronger assumptions). Now the same results of model theory can be used to build a model of NFU and verify that it is a model of NFU in much the same way, with the Tα's being used in place of Vα in the usual construction. The final move is to observe that since NFU is consistent, we can drop the use of absolute types in our metatheory, bootstrapping the metatheory from TSTU to NFU.

Facts about the automorphism j

The automorphism j of a model of this kind is closely related to certain natural operations in NFU. In Mathematics, an automorphism is an Isomorphism from a Mathematical object to itself In Mathematics, an automorphism is an Isomorphism from a Mathematical object to itself For example, if W is a well-ordering in the nonstandard model (we suppose here that we use Kuratowski pairs so that the coding of functions in the two theories will agree to some extent) which is also a well-ordering in NFU (all well-orderings of NFU are well-orderings in the nonstandard model of Zermelo set theory, but not vice versa, due to the formation of urelements in the construction of the model), and W has type α in NFU, then j(W) will be a well-ordering of type T(α) in NFU. In Mathematics, a well-order relation (or well-ordering) on a set S is a Total order on S with the property that every In Mathematics, an ordered pair is a collection of two distinguishable objects one of which is identified as the first coordinate (or the first entry In Set theory, a branch of Mathematics, an urelement or ur-element (from the German prefix ur-, 'primordial' is an object (concrete

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 Vj(α) 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.

Strong axioms of Infinity

In this section we mainly discuss the effect of adding various "strong axioms of infinity" to our usual base theory, NFU + Infinity + Choice. This base theory, known consistent, has the same strength as TST + Infinity, or Zermelo set theory with Separation restricted to bounded formulas (Mac Lane set theory).

One can add to this base theory strong axioms of infinity familiar from the ZFC context, such as "there exits an inaccessible cardinal," but it is more natural to consider assertions about cantorian and strongly cantorian sets. Zermelo–Fraenkel set theory with the axiom of choice, commonly abbreviated ZFC, is the standard form of Axiomatic set theory and as such is the most common Such assertions not only bring into being large cardinals of the usual sorts, but strengthen the theory on its own terms. In the mathematical field of Set theory, a large cardinal property is a certain kind of property of Transfinite Cardinal numbers Cardinals with such properties

The weakest of the usual strong principles is:

• Rosser's Axiom of Counting. The set of natural numbers is a strongly cantorian set.

To see how natural numbers are defined in NFU, see set-theoretic definition of natural numbers. Several ways have been proposed to define the Natural numbers using Set theory. The original form of this axiom given by Rosser was "the set {m|1≤m≤n} has n members", for each natural number n". This intuitively obvious assertion is unstratified: what is provable in NFU is "the set {m|1≤m≤n} has T2(n) members" (where the T operation on cardinals is defined by T( | A | ) = | P1(A) | ; this raises the type of a cardinal by one). For any cardinal number (including natural numbers) to assert T( | A | ) = | A | is equivalent to asserting that the sets A of that cardinality are cantorian (by a usual abuse of language, we refer to such cardinals as "cantorian cardinals"). It is straightforward to show that the assertion that each natural number is cantorian is equivalent to the assertion that the set of all natural numbers is strongly cantorian.

Counting is consistent with NFU, but increases its consistency strength noticeably; not, as one would expect, in the area of arithmetic, but in higher set theory. NFU + Infinity proves that each $\beth_n$ exists, but not that $\beth_{\omega}$ exists; NFU + Counting (easily) proves Infinity, and further proves the existence of $\beth_{\beth_n}$ for each n, but not the existence of $\beth_{\beth_{\omega}}$. (See beth numbers). In Mathematics, the Infinite Cardinal numbers are represented by the Hebrew letter \aleph ( aleph) indexed with a subscript that runs

Counting implies immediately that one does not need to assign types to variables restricted to the set N of natural numbers for purposes of stratification; it is a theorem that the power set of a strongly cantorian set is strongly cantorian, so it is further not necessary to assign types to variables restricted to any iterated power set of the natural numbers, or to such familiar sets as the set of real numbers, the set of functions from reals to reals, and so forth. In Mathematics, given a set S, the power set (or powerset) of S, written \mathcal{P}(S P ( S) The set-theoretical strength of Counting is less important in practice than the convenience of not having to annotate variables known to have natural number values (or related kinds of values) with singleton brackets, or to apply the T operation in order to get stratified set definitions.

Counting implies Infinity; each of the axioms below needs to be adjoined to NFU + Infinity to get the effect of strong variants of Infinity; Ali Enayat has investigated the strength of some of these axioms in models of NFU + "the universe is finite".

A model of the kind constructed above satisfies Counting just in case the automorphism j fixes all natural numbers in the underlying nonstandard model of Zermelo set theory.

The next strong axiom we consider is the

• Axiom of strongly cantorian separation: For any strongly cantorian set A and any formula φ (not necessarily stratified!) the set {x∈A|φ} exists.

Immediate consequences include Mathematical Induction for unstratified conditions (which is not a consequence of Counting; many but not all unstratified instances of induction on the natural numbers follow from Counting).

This axiom is surprisingly strong. Unpublished work of Robert Solovay shows that the consistency strength of the theory NFU* = NFU + Counting + Strongly Cantorian Separation is the same as that of Zermelo set theory + Σ2 Replacement.

This axiom holds in a model of the kind constructed above (with Choice) if the ordinals which are fixed by j and dominate only ordinals fixed by j in the underlying nonstandard model of Zermelo set theory are standard, and the power set of any such ordinal in the model is also standard. This condition is sufficient but not necessary.

Next is

• Axiom of Cantorian Sets: Every cantorian set is strongly cantorian.

This very simple and appealing assertion is extremely strong. Solovay has shown the precise equivalence of the consistency strength of the theory NFUA = NFU + Infinity + Cantorian Sets with that of ZFC + a schema asserting the existence of an n-Mahlo cardinal for each concrete natural number n. Zermelo–Fraenkel set theory with the axiom of choice, commonly abbreviated ZFC, is the standard form of Axiomatic set theory and as such is the most common Ali Enayat has shown that the theory of cantorian equivalence classes of well-founded extensional relations (which gives a natural picture of an initial segment of the cumulative hierarchy of ZFC) interprets the extension of ZFC with n-Mahlo cardinals directly. Zermelo–Fraenkel set theory with the axiom of choice, commonly abbreviated ZFC, is the standard form of Axiomatic set theory and as such is the most common Zermelo–Fraenkel set theory with the axiom of choice, commonly abbreviated ZFC, is the standard form of Axiomatic set theory and as such is the most common A permutation technique can be applied to a model of this theory to give a model in which the hereditarily strongly cantorian sets with the usual membership relation model the strong extension of ZFC. Zermelo–Fraenkel set theory with the axiom of choice, commonly abbreviated ZFC, is the standard form of Axiomatic set theory and as such is the most common

This axiom holds in a model of the kind constructed above (with Choice) just in case the ordinals fixed by j in the underlying nonstandard model of ZFC are an initial (proper class) segment of the ordinals of the model. Zermelo–Fraenkel set theory with the axiom of choice, commonly abbreviated ZFC, is the standard form of Axiomatic set theory and as such is the most common

Next consider the

• Axiom of Cantorian Separation: For any cantorian set A and any formula φ (not necessarily stratified!) the set {x∈A|φ} exists.

This combines the effect of the two preceding axioms and is actually even stronger (precisely how is not known). Unstratified mathematical induction enables proving that there are n-Mahlo cardinals for every n, given Cantorian Sets, which gives an extension of ZFC that is even stronger than the previous one, which only asserts that there are n-Mahlos for each concrete natural number (leaving open the possibility of nonstandard counterexamples). Zermelo–Fraenkel set theory with the axiom of choice, commonly abbreviated ZFC, is the standard form of Axiomatic set theory and as such is the most common

This axiom will hold in a model of the kind described above if every ordinal fixed by j is standard, and every power set of an ordinal fixed by j is also standard in the underlying model of ZFC. In Mathematics, given a set S, the power set (or powerset) of S, written \mathcal{P}(S P ( S) Zermelo–Fraenkel set theory with the axiom of choice, commonly abbreviated ZFC, is the standard form of Axiomatic set theory and as such is the most common Again, this condition is sufficient but not necessary.

An ordinal is said to be cantorian if it is fixed by T, and strongly cantorian if it dominates only cantorian ordinals (this implies that it is itself cantorian). In models of the kind constructed above, cantorian ordinals of NFU correspond to ordinals fixed by j (they are not the same objects because different definitions of ordinal numbers are used in the two theories).

Equal in strength to Cantorian Sets is the

• Axiom of Large Ordinals: For each noncantorian ordinal α, there is a natural number n such that Tn(Ω) < α.

Recall that Ω is the order type of the natural order on all ordinals. This only implies Cantorian Sets if we have Choice (but is at that level of consistency strength in any case). It is remarkable that one can even define Tn(Ω): this is the nth term sn of any finite sequence of ordinals s of length n such that s0 = Ω, si + 1 = T(si) for each appropriate i. This definition is completely unstratified. The uniqueness of Tn(Ω) can be proved (for those n for which it exists) and a certain amount of common-sense reasoning about this notion can be carried out, enough to show that Large Ordinals implies Cantorian Sets in the presence of Choice. In spite of the knotty formal statement of this axiom, it is a very natural assumption, amounting to making the action of T on the ordinals as simple as possible.

A model of the kind constructed above will satisfy Large Ordinals, if the ordinals moved by j are exactly the ordinals which dominate some j − i(α) in the underlying nonstandard model of ZFC. Zermelo–Fraenkel set theory with the axiom of choice, commonly abbreviated ZFC, is the standard form of Axiomatic set theory and as such is the most common

• Axiom of Small Ordinals: For any formula φ, there is a set A such that the elements of A which are strongly Cantorian ordinals are exactly the strongly cantorian ordinals such that φ.

Solovay has shown the precise equivalence in consistency strength of NFUB = NFU + Infinity + Cantorian Sets + Small Ordinals with Morse–Kelley set theory plus the assertion that the proper class ordinal (the class of all ordinals) is a weakly compact cardinal. In the Foundation of mathematics, Kelley–Morse (KM or Morse–Kelley (MK set theory is a first order Axiomatic set theory that is closely In Mathematics, a weakly compact cardinal is a certain kind of Cardinal number introduced by; weakly compact cardinals are Large cardinals meaning that This is very strong indeed! Moreover, NFUB-, which is NFUB with Cantorian Sets omitted, is easily seen to have the same strength as NFUB.

A model of the kind constructed above will satisfy this axiom if every collection of ordinals fixed by j is the intersection of some set of ordinals with the ordinals fixed by j, in the underlying nonstandard model of ZFC.

Even stronger is the theory NFUM = NFU + Infinity + Large Ordinals + Small Ordinals. This is equivalent to Morse–Kelley set theory with a predicate on the classes which is a κ-complete nonprincipal ultrafilter on the proper class ordinal κ; in effect, this is Morse–Kelley set theory + "the proper class ordinal is a measurable cardinal"!

The technical details here are not the main point, which is that reasonable and natural (in the context of NFU) assertions turn out to be equivalent in power to very strong axioms of infinity in the ZFC context. In the Foundation of mathematics, Kelley–Morse (KM or Morse–Kelley (MK set theory is a first order Axiomatic set theory that is closely In the mathematical field of Set theory, an ultrafilter on a set X is a collection of Subsets of X that is a filter, that In Mathematics, a measurable cardinal is a certain kind of Large cardinal number Zermelo–Fraenkel set theory with the axiom of choice, commonly abbreviated ZFC, is the standard form of Axiomatic set theory and as such is the most common This fact is related to the correlation between the existence of models of NFU, described above and satisfying these axioms, and the existence of models of ZFC with automorphisms having special properties. Zermelo–Fraenkel set theory with the axiom of choice, commonly abbreviated ZFC, is the standard form of Axiomatic set theory and as such is the most common In Mathematics, an automorphism is an Isomorphism from a Mathematical object to itself

References

1. ^ Hailperin, T. Generically an alternative set theory is an alternative mathematical approach to the concept of set. This article examines the implementation of mathematical concepts in Set theory. In Mathematical logic, positive set theory is the name for a class of alternative set theories in which the Axiom of comprehension "\{x Several ways have been proposed to define the Natural numbers using Set theory. In Set theory, a universal set is a set which contains all objects including itself “A set of axioms for logic,” Journal of Symbolic Logic 9, pp. The Association for Symbolic Logic ("ASL" is an International organization of specialists in Mathematical logic and Philosophical logic —the 1-19.
• Crabbé , Marcel, 1982, On the consistency of an impredicative fragment of Quine's NF, The Journal of Symbolic Logic 47: 131-136.
• Holmes , Randall, 1998. Elementary Set Theory with a Universal Set. Academia-Bruylant. The publisher has graciously consented to permit diffusion of this introduction to NFU via the web. Copyright is reserved.
• Jensen, R. B., 1969, "On the Consistency of a Slight(?) Modification of Quine's NF," Synthese 19: 250-63. Ronald Björn Jensen (born April 1 1936 is an American mathematician active in Europe primarily known for his work in Mathematical logic and Set theory With discussion by Quine.
• Quine, W. V., 1980, "New Foundations for Mathematical Logic" in From a Logical Point of View, 2nd ed. Willard Van Orman Quine (June 25 1908 Akron, Ohio &ndash December 25 2000 (known to intimates as "Van" , revised. Harvard Univ. Press: 80-101. The definitive version of where it all began, namely Quine's 1937 paper in the American Mathematical Monthly.
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 31, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0}, "config": {"markdown_headings": false, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "github"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "english_confidence": 0.9320449829101562, "perplexity_flag": "head"}