HOME
*





Zero Sharp
In the mathematical discipline of set theory, 0# (zero sharp, also 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 integers (using Gödel numbering), 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 , where it was denoted by Σ, and rediscovered by , who considered it as a subset of the natural numbers and introduced the notation O# (with a capital letter O; this later changed to the numeral '0'). Roughly speaking, if 0# exists then the universe ''V'' of sets is much larger than the universe ''L'' of constructible sets, while if it does not exist then the universe of all sets is closely approximated by the constructible sets. Definition ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Set Theory
Set theory is the branch of mathematical logic that studies sets, which can be informally described as collections of objects. Although objects of any kind can be collected into a set, set theory, as a branch of mathematics, is mostly concerned with those that are relevant to mathematics as a whole. The modern study of set theory was initiated by the German mathematicians Richard Dedekind and Georg Cantor in the 1870s. In particular, Georg Cantor is commonly considered the founder of set theory. The non-formalized systems investigated during this early stage go under the name of '' naive set theory''. After the discovery of paradoxes within naive set theory (such as Russell's paradox, Cantor's paradox and the Burali-Forti paradox) various axiomatic systems were proposed in the early twentieth century, of which Zermelo–Fraenkel set theory (with or without the axiom of choice) is still the best-known and most studied. Set theory is commonly employed as a foundational ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Leo Harrington
Leo Anthony Harrington (born May 17, 1946) is a professor of mathematics at the University of California, Berkeley who works in recursion theory, model theory, and set theory. Having retired from being a Mathematician, Professor Leo Harrington is now a Philosopher. His notable results include proving the Paris–Harrington theorem along with Jeff Paris, showing that if the axiom of determinacy holds for all analytic sets then ''x''# exists for all reals ''x'', and proving with Saharon Shelah that the first-order theory of the partially ordered set of recursively enumerable Turing degrees In computer science and mathematical logic the Turing degree (named after Alan Turing) or degree of unsolvability of a set of natural numbers measures the level of algorithmic unsolvability of the set. Overview The concept of Turing degree is fund ... is undecidable. References External linksHome page * Living people American logicians 20th-century American mathematicians 21st-cent ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


List Of Forcing Notions
In mathematics, forcing (mathematics), forcing is a method of constructing new models ''M''[''G''] of set theory by adding a generic subset ''G'' of a poset ''P'' to a model ''M''. The poset ''P'' used will determine what statements hold in the new universe (the 'extension'); to force a statement of interest thus requires construction of a suitable ''P''. This article lists some of the posets ''P'' that have been used in this construction. Notation *''P'' is a poset with order < *''V'' is the universe of all sets *''M'' is a countable transitive model of set theory *''G'' is a generic subset of ''P'' over ''M''.


Definitions

*''P'' satisfies the countable chain condition if every antichain in ''P'' is at most countable. This implies that ''V'' and ''V''[''G''] have the same cardinals (and the same cofinalities). *A subset ''D'' of ''P'' is called dense if for every there is some with . *A filter on ''P'' is a nonempty subset ''F'' of ''P'' such that if and th ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Forcing (mathematics)
In the mathematical discipline of set theory, forcing is a technique for proving consistency and independence results. It was first used by Paul Cohen in 1963, to prove the independence of the axiom of choice and the continuum hypothesis from Zermelo–Fraenkel set theory. Forcing has been considerably reworked and simplified in the following years, and has since served as a powerful technique, both in set theory and in areas of mathematical logic such as recursion theory. Descriptive set theory uses the notions of forcing from both recursion theory and set theory. Forcing has also been used in model theory, but it is common in model theory to define genericity directly without mention of forcing. Intuition Intuitively, forcing consists of expanding the set theoretical universe V to a larger universe V^ . In this bigger universe, for example, one might have many new real numbers, identified with subsets of the set \mathbb of natural numbers, that were not there in the old ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  




Ronald Jensen
Ronald Björn Jensen (born April 1, 1936) is an American mathematician who lives in Germany, primarily known for his work in mathematical logic and set theory. Career Jensen completed a BA in economics at American University in 1959, and a Ph.D. in mathematics at the University of Bonn in 1964. His supervisor was Gisbert Hasenjaeger. Jensen taught at Rockefeller University, 1969–71, and the University of California, Berkeley, 1971–73. The balance of his academic career was spent in Europe at the University of Bonn, the University of Oslo, the University of Freiburg, the University of Oxford, and the Humboldt-Universität zu Berlin, from which he retired in 2001. He now resides in Berlin. Jensen was honored by the Association for Symbolic Logic as the first Gödel Lecturer in 1990. In 2015, the European Set Theory Society awarded him and John R. Steel the Hausdorff Medal for their paper "K without the measurable". Results Jensen's better-known results include the: * Axiomatic ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Cardinality
In mathematics, the cardinality of a set is a measure of the number of elements of the set. For example, the set A = \ contains 3 elements, and therefore A has a cardinality of 3. Beginning in the late 19th century, this concept was generalized to infinite sets, which allows one to distinguish between different types of infinity, and to perform arithmetic on them. There are two approaches to cardinality: one which compares sets directly using bijections and injections, and another which uses cardinal numbers. The cardinality of a set is also called its size, when no confusion with other notions of size is possible. The cardinality of a set A is usually denoted , A, , with a vertical bar on each side; this is the same notation as absolute value, and the meaning depends on context. The cardinality of a set A may alternatively be denoted by n(A), , \operatorname(A), or \#A. History A crude sense of cardinality, an awareness that groups of things or events compare with other grou ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Jensen's Covering Lemma
In set theory, Jensen's covering theorem states that if 0# does not exist then every uncountable set of ordinals is contained in a constructible set of the same cardinality. Informally this conclusion says that the constructible universe is close to the universe of all sets. The first proof appeared in . Silver later gave a fine-structure-free proof using his machines and finally gave an even simpler proof. The converse of Jensen's covering theorem is also true: if 0# exists then the countable set of all cardinals less than ℵω cannot be covered by a constructible set of cardinality less than ℵω. In his book ''Proper Forcing'', Shelah proved a strong form of Jensen's covering lemma. Hugh Woodin William Hugh Woodin (born April 23, 1955) is an American mathematician and set theorist at Harvard University. He has made many notable contributions to the theory of inner models and determinacy. A type of large cardinals, the Woodin cardinals ... states it as:"In search of U ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Axiom Of Constructibility
The axiom of constructibility is a possible axiom for set theory in mathematics that asserts that every set is constructible universe, constructible. The axiom is usually written as ''V'' = ''L'', where ''V'' and ''L'' denote the von Neumann universe and the constructible universe, respectively. The axiom, first investigated by Kurt Gödel, is inconsistent with the proposition that zero sharp exists and stronger large cardinal axioms (see list of large cardinal properties). Generalizations of this axiom are explored in inner model theory. Implications The axiom of constructibility implies the axiom of choice (AC), given Zermelo–Fraenkel set theory without the axiom of choice (ZF). It also settles many natural mathematical questions that are independent of Zermelo–Fraenkel set theory with the axiom of choice (ZFC); for example, the axiom of constructibility implies the Continuum hypothesis#The generalized continuum hypothesis, generalized continuum hypothesis, the negation of ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Ineffable Cardinal
In the mathematics of transfinite numbers, an ineffable cardinal is a certain kind of large cardinal number, introduced by . In the following definitions, \kappa will always be a regular uncountable cardinal number. A cardinal number \kappa is called almost ineffable if for every f: \kappa \to \mathcal(\kappa) (where \mathcal(\kappa) is the powerset of \kappa) with the property that f(\delta) is a subset of \delta for all ordinals \delta < \kappa, there is a subset S of \kappa having cardinality \kappa and for f, in the sense that for any \delta_1 < \delta_2 in S, f(\delta_1) = f(\delta_2) \cap \delta_1. A

picture info

Cardinal Number
In mathematics, cardinal numbers, or cardinals for short, are a generalization of the natural numbers used to measure the cardinality (size) of sets. The cardinality of a finite set is a natural number: the number of elements in the set. The ''transfinite'' cardinal numbers, often denoted using the Hebrew symbol \aleph ( aleph) followed by a subscript, describe the sizes of infinite sets. Cardinality is defined in terms of bijective functions. Two sets have the same cardinality if, and only if, there is a one-to-one correspondence (bijection) between the elements of the two sets. In the case of finite sets, this agrees with the intuitive notion of size. In the case of infinite sets, the behavior is more complex. A fundamental theorem due to Georg Cantor shows that it is possible for infinite sets to have different cardinalities, and in particular the cardinality of the set of real numbers is greater than the cardinality of the set of natural numbers. It is also possible for ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  




Uncountable Set
In mathematics, an uncountable set (or uncountably infinite set) is an infinite set that contains too many elements to be countable. The uncountability of a set is closely related to its cardinal number: a set is uncountable if its cardinal number is larger than that of the set of all natural numbers. Characterizations There are many equivalent characterizations of uncountability. A set ''X'' is uncountable if and only if any of the following conditions hold: * There is no injective function (hence no bijection) from ''X'' to the set of natural numbers. * ''X'' is nonempty and for every ω-sequence of elements of ''X'', there exists at least one element of X not included in it. That is, ''X'' is nonempty and there is no surjective function from the natural numbers to ''X''. * The cardinality of ''X'' is neither finite nor equal to \aleph_0 (aleph-null, the cardinality of the natural numbers). * The set ''X'' has cardinality strictly greater than \aleph_0. The first three ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Regular Cardinal
In set theory, a regular cardinal is a cardinal number that is equal to its own cofinality. More explicitly, this means that \kappa is a regular cardinal if and only if every unbounded subset C \subseteq \kappa has cardinality \kappa. Infinite well-ordered cardinals that are not regular are called singular cardinals. Finite cardinal numbers are typically not called regular or singular. In the presence of the axiom of choice, any cardinal number can be well-ordered, and then the following are equivalent for a cardinal \kappa: # \kappa is a regular cardinal. # If \kappa = \sum_ \lambda_i and \lambda_i < \kappa for all i, then , I, \ge \kappa. # If S = \bigcup_ S_i, and if , I, < \kappa and , S_i, < \kappa for all i, then , S, < \kappa. # The