Θ (set theory)

Last updated June 01, 2024

In set theory, $\varTheta$ (pronounced like the letter theta) is the least nonzero ordinal $\alpha$ such that there is no surjection from the reals onto $\alpha$ .

$\varTheta$ has been studied in connection with strong partition cardinals and the axiom of determinacy.^[1] The axiom of determinacy is equivalent to the existence of unboundedly many strong partition cardinals below $\varTheta$ , in the sense that every cardinal below $\varTheta$ has a strong partition cardinal above it.^[2] This does not preclude the possibility that a single strong partition cardinal, above $\varTheta$ , suffices for all cardinals below $\varTheta$ , but the existence of such a cardinal would have additional consequences.^[1]

If the reals can be well-ordered, then $\varTheta$ is simply $(2^{\aleph _{0}})^{+}$ , the cardinal successor of the cardinality of the continuum. Any set may be well-ordered assuming the axiom of choice (AC). However, Θ is often studied in contexts where the axiom of choice fails, such as models of the axiom of determinacy.^{[ citation needed ]}

$\varTheta$ is also the supremum of the order types of all prewellorderings of the reals.^{[ citation needed ]}

Proof of existence

It may not be obvious that it can be proven, without using AC, that there even exists a nonzero ordinal onto which there is no surjection from the reals (if there is such an ordinal, then there must be a least one because the ordinals are wellordered). However, suppose there were no such ordinal. Then to every ordinal α we could associate the set of all prewellorderings of the reals having order type α. This would give an injection from the class of all ordinals into the set of all sets of orderings on the reals (which can to be seen to be a set via repeated application of the powerset axiom). Now the axiom of replacement shows that the class of all ordinals is in fact a set. But that is impossible, by the Burali-Forti paradox.^{[ citation needed ]}

Related Research Articles

In mathematics, the axiom of choice, abbreviated AC or AoC, is an axiom of set theory equivalent to the statement that a Cartesian product of a collection of non-empty sets is non-empty. Informally put, the axiom of choice says that given any collection of sets, each containing at least one element, it is possible to construct a new set by choosing one element from each set, even if the collection is infinite. Formally, it states that for every indexed family $of nonempty sets, there exists an indexed set such that for every . The axiom of choice was formulated in 1904 by Ernst Zermelo in order to formalize his proof of the well-ordering theorem.$

In mathematics, specifically set theory, the continuum hypothesis is a hypothesis about the possible sizes of infinite sets. It states:

"There is no set whose cardinality is strictly between that of the integers and the real numbers."

In set theory, the axiom schema of replacement is a schema of axioms in Zermelo–Fraenkel set theory (ZF) that asserts that the image of any set under any definable mapping is also a set. It is necessary for the construction of certain infinite sets in ZF.

In set theory, an uncountable cardinal is inaccessible if it cannot be obtained from smaller cardinals by the usual operations of cardinal arithmetic. More precisely, a cardinal $κ$ is strongly inaccessible if it satisfies the following three conditions: it is uncountable, it is not a sum of fewer than $κ$ cardinals smaller than $κ$ , and $implies .$

In the mathematical discipline of set theory, 0^# is the set of true formulae about indiscernibles and order-indiscernibles in the Gödel constructible universe. It is often encoded as a subset of the natural numbers, or as a subset of the hereditarily finite sets, or as a real number. Its existence is unprovable in ZFC, the standard form of axiomatic set theory, but follows from a suitable large cardinal axiom. It was first introduced as a set of formulae in Silver's 1966 thesis, later published as Silver (1971), where it was denoted by Σ, and rediscovered by Solovay, who considered it as a subset of the natural numbers and introduced the notation O^#.

In set theory, a branch of mathematics, a Q-indescribable cardinal is a certain kind of large cardinal number that is hard to axiomatize in some language Q. There are many different types of indescribable cardinals corresponding to different choices of languages Q. They were introduced by Hanf & Scott (1961).

In set theory, a Woodin cardinal is a cardinal number $such that for all functions, there exists a cardinal with and an elementary embedding from the Von Neumann universe into a transitive inner model with critical point and .$

In set theory, a branch of mathematics, a rank-into-rank embedding is a large cardinal property defined by one of the following four axioms given in order of increasing consistency strength.

In set theory, a regular cardinal is a cardinal number that is equal to its own cofinality. More explicitly, this means that $is a regular cardinal if and only if every unbounded subset has cardinality . Infinite well-ordered cardinals that are not regular are called singular cardinals . Finite cardinal numbers are typically not called regular or singular.$

In mathematics, particularly in set theory, the beth numbers are a certain sequence of infinite cardinal numbers, conventionally written $, where is the Hebrew letter beth. The beth numbers are related to the aleph numbers, but unless the generalized continuum hypothesis is true, there are numbers indexed by that are not indexed by .$

In mathematical logic, descriptive set theory (DST) is the study of certain classes of "well-behaved" subsets of the real line and other Polish spaces. As well as being one of the primary areas of research in set theory, it has applications to other areas of mathematics such as functional analysis, ergodic theory, the study of operator algebras and group actions, and mathematical logic.

Determinacy is a subfield of set theory, a branch of mathematics, that examines the conditions under which one or the other player of a game has a winning strategy, and the consequences of the existence of such strategies. Alternatively and similarly, "determinacy" is the property of a game whereby such a strategy exists. Determinacy was introduced by Gale and Stewart in 1950, under the name "determinateness".

In set theory, a branch of mathematics, a reflection principle says that it is possible to find sets that, with respect to any given property, resemble the class of all sets. There are several different forms of the reflection principle depending on exactly what is meant by "resemble". Weak forms of the reflection principle are theorems of ZF set theory due to Montague (1961), while stronger forms can be new and very powerful axioms for set theory.

This article examines the implementation of mathematical concepts in set theory. The implementation of a number of basic mathematical concepts is carried out in parallel in ZFC and in NFU, the version of Quine's New Foundations shown to be consistent by R. B. Jensen in 1969.

In the mathematical discipline of set theory, there are many ways of describing specific countable ordinals. The smallest ones can be usefully and non-circularly expressed in terms of their Cantor normal forms. Beyond that, many ordinals of relevance to proof theory still have computable ordinal notations. However, it is not possible to decide effectively whether a given putative ordinal notation is a notation or not ; various more-concrete ways of defining ordinals that definitely have notations are available.

<span class="mw-page-title-main">Axiom of limitation of size</span>

In set theory, the axiom of limitation of size was proposed by John von Neumann in his 1925 axiom system for sets and classes. It formalizes the limitation of size principle, which avoids the paradoxes encountered in earlier formulations of set theory by recognizing that some classes are too big to be sets. Von Neumann realized that the paradoxes are caused by permitting these big classes to be members of a class. A class that is a member of a class is a set; a class that is not a set is a proper class. Every class is a subclass of V, the class of all sets. The axiom of limitation of size says that a class is a set if and only if it is smaller than V—that is, there is no function mapping it onto V. Usually, this axiom is stated in the equivalent form: A class is a proper class if and only if there is a function that maps it onto V.

In set theory, Ω-logic is an infinitary logic and deductive system proposed by W. Hugh Woodin as part of an attempt to generalize the theory of determinacy of pointclasses to cover the structure $. Just as the axiom of projective determinacy yields a canonical theory of, he sought to find axioms that would give a canonical theory for the larger structure. The theory he developed involves a controversial argument that the continuum hypothesis is false.$

In proof theory, ordinal analysis assigns ordinals to mathematical theories as a measure of their strength. If theories have the same proof-theoretic ordinal they are often equiconsistent, and if one theory has a larger proof-theoretic ordinal than another it can often prove the consistency of the second theory.

In set theory, an ordinal number, or ordinal, is a generalization of ordinal numerals aimed to extend enumeration to infinite sets.

This is a glossary of set theory.

References

1 2 Cunningham, Daniel W. (2017), "A strong partition cardinal above $\varTheta$ ", Archive for Mathematical Logic, 56 (3–4): 403–421, doi:10.1007/s00153-017-0529-8, MR 3633802
↑ Kechris, Alexander S.; Woodin, W. Hugh (2008), "The equivalence of partition properties and determinacy", Games, scales, and Suslin cardinals: The Cabal Seminar, Vol. I, Lecture Notes in Logic, vol. 31, Chicago: Association for Symbolic Logic, pp. 355–378, doi:10.1017/CBO9780511546488.018, ISBN 978-0-521-89951-2, MR 2463618

This set theory-related article is a stub. You can help Wikipedia by expanding it.

This page is based on this Wikipedia article
Text is available under the CC BY-SA 4.0 license; additional terms may apply.
Images, videos and audio are available under their respective licenses.

[above-1] 1 2 Cunningham, Daniel W. (2017), "A strong partition cardinal above $\varTheta$ ", Archive for Mathematical Logic, 56 (3–4): 403–421, doi:10.1007/s00153-017-0529-8, MR 3633802

[below-2] Kechris, Alexander S.; Woodin, W. Hugh (2008), "The equivalence of partition properties and determinacy", Games, scales, and Suslin cardinals: The Cabal Seminar, Vol. I, Lecture Notes in Logic, vol. 31, Chicago: Association for Symbolic Logic, pp. 355–378, doi:10.1017/CBO9780511546488.018, ISBN 978-0-521-89951-2, MR 2463618

[1]

[2]