|
Proper Forcing Axiom
In the mathematical field of set theory, the proper forcing axiom (''PFA'') is a significant strengthening of Martin's axiom, where forcings with the countable chain condition (ccc) are replaced by proper forcings. Statement A forcing or partially ordered set P is proper if for all regular uncountable cardinals \lambda , forcing with P preserves stationary subsets of lambda\omega . The proper forcing axiom asserts that if P is proper and Dα is a dense subset of P for each α<ω1, then there is a filter G P such that Dα ∩ G is nonempty for all α<ω1. The class of proper forcings, to which PFA can be applied, is rather large. For example, standard arguments show that if P is or [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
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] |
John R
John R. (born John Richbourg, August 20, 1910 - February 15, 1986) was an American radio disc jockey who attained fame in the 1950s and 1960s for playing rhythm and blues music on Nashville radio station WLAC. He was also a notable record producer and artist manager. Richbourg was arguably the most popular and charismatic of the four announcers at WLAC who showcased popular African-American music in nightly programs from the late 1940s to the early 1970s. (The other three were Gene Nobles, Herman Grizzard, and Bill "Hoss" Allen.) Later rock music disc jockeys, such as Alan Freed and Wolfman Jack, mimicked Richbourg's practice of using speech that simulated African-American street language of the mid-twentieth century. Richbourg's highly stylized approach to on-air presentation of both music and advertising earned him popularity, but it also created identity confusion. Because Richbourg and fellow disc jockey Allen used African-American speech patterns, many listeners thought that ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Stevo Todorčević
Stevo Todorčević ( sr-Cyrl, Стево Тодорчевић; born February 9, 1955), is a Yugoslavian mathematician specializing in mathematical logic and set theory. He holds a Canada Research Chair in mathematics at the University of Toronto, and a director of research position at the Centre national de la recherche scientifique in Paris. Early life and education Todorčević was born in Ubovića Brdo. As a child he moved to Banatsko Novo Selo, and went to school in Pančevo. At Belgrade University, he studied pure mathematics, attending lectures by Đuro Kurepa. He began graduate studies in 1978, and wrote his doctoral thesis in 1979 with Kurepa as his advisor. Research Todorčević's work involves mathematical logic, set theory, and their applications to pure mathematics. In Todorčević's 1978 master’s thesis, he constructed a model of MA + ¬wKH in a way to allow him to make the continuum any regular cardinal, and so derived a variety of topological consequences. ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Saharon Shelah
Saharon Shelah ( he, שהרן שלח; born July 3, 1945) is an Israeli mathematician. He is a professor of mathematics at the Hebrew University of Jerusalem and Rutgers University in New Jersey. Biography Shelah was born in Jerusalem on July 3, 1945. He is the son of the Israeli poet and political activist Yonatan Ratosh. He received his PhD for his work on stable theories in 1969 from the Hebrew University. Shelah is married to Yael, and has three children. His brother, magistrate judge Hamman Shelah was murdered along with his wife and daughter by an Egyptian soldier in the Ras Burqa massacre in 1985. Shelah planned to be a scientist while at primary school, but initially was attracted to physics and biology, not mathematics. Later he found mathematical beauty in studying geometry: He said, "But when I reached the ninth grade I began studying geometry and my eyes opened to that beauty—a system of demonstration and theorems based on a very small number of axioms which impr ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Large Cardinal
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 are, as the name suggests, generally very "large" (for example, bigger than the least α such that α=ωα). The proposition that such cardinals exist cannot be proved in the most common axiomatization of set theory, namely ZFC, and such propositions can be viewed as ways of measuring how "much", beyond ZFC, one needs to assume to be able to prove certain desired results. In other words, they can be seen, in Dana Scott's phrase, as quantifying the fact "that if you want more you have to assume more". There is a rough convention that results provable from ZFC alone may be stated without hypotheses, but that if the proof requires other assumptions (such as the existence of large cardinals), these should be stated. Whether this is simply a linguistic convention, or something more, is a controversial point among distinct philo ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Martin's Maximum
In set theory, a branch of mathematical logic, Martin's maximum, introduced by and named after Donald Martin, is a generalization of the proper forcing axiom, itself a generalization of Martin's axiom. It represents the broadest class of forcings for which a forcing axiom is consistent. Martin's maximum (MM) states that if ''D'' is a collection of \aleph_1 dense subsets of a notion of forcing that preserves stationary subsets of ''ω''1, then there is a ''D''-generic filter. Forcing with a ccc notion of forcing preserves stationary subsets of ''ω''1, thus MM extends \operatorname(\aleph_1). If (''P'',≤) is not a stationary set preserving notion of forcing, i.e., there is a stationary subset of ''ω''1, which becomes nonstationary when forcing with (''P'',≤), then there is a collection ''D'' of \aleph_1 dense subsets of (''P'',≤), such that there is no ''D''-generic filter. This is why MM is called the maximal extension of Martin's axiom. The existence of a supercompact ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Antichain
In mathematics, in the area of order theory, an antichain is a subset of a partially ordered set such that any two distinct elements in the subset are incomparable. The size of the largest antichain in a partially ordered set is known as its width. By Dilworth's theorem, this also equals the minimum number of chains (totally ordered subsets) into which the set can be partitioned. Dually, the height of the partially ordered set (the length of its longest chain) equals by Mirsky's theorem the minimum number of antichains into which the set can be partitioned. The family of all antichains in a finite partially ordered set can be given join and meet operations, making them into a distributive lattice. For the partially ordered system of all subsets of a finite set, ordered by set inclusion, the antichains are called Sperner families and their lattice is a free distributive lattice, with a Dedekind number of elements. More generally, counting the number of antichains of a finite pa ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Laver Function
In set theory, a Laver function (or Laver diamond, named after its inventor, Richard Laver) is a function connected with supercompact cardinals. Definition If κ is a supercompact cardinal, a Laver function is a function ''ƒ'':κ → ''V''κ such that for every set ''x'' and every cardinal λ ≥ , TC(''x''), + κ there is a supercompact measure ''U'' on sup><κ such that if ''j'' ''U'' is the associated elementary embedding then ''j'' ''U''(''ƒ'')(κ) = ''x''. (Here ''V''κ denotes the κ-th level of the , TC(''x'') is the of ''x'') Applications The original application of Laver funct ...[...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Supercompact Cardinal
In set theory, a supercompact cardinal is a type of large cardinal. They display a variety of reflection properties. Formal definition If ''λ'' is any ordinal, ''κ'' is ''λ''-supercompact means that there exists an elementary embedding ''j'' from the universe ''V'' into a transitive inner model ''M'' with critical point ''κ'', ''j''(''κ'')>''λ'' and :^\lambda M\subseteq M \,. That is, ''M'' contains all of its ''λ''-sequences. Then ''κ'' is supercompact means that it is ''λ''-supercompact for all ordinals ''λ''. Alternatively, an uncountable cardinal ''κ'' is supercompact if for every ''A'' such that , ''A'', ≥ ''κ'' there exists a normal measure over 'A''sup>< ''κ'' with the additional property that every function such that is constant on a set in . Here "constan ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Woodin Cardinal
In set theory, a Woodin cardinal (named for W. Hugh Woodin) is a cardinal number \lambda such that for all functions :f : \lambda \to \lambda there exists a cardinal \kappa < \lambda with : and an : from the into a transitive with critical point and : An equivalent definition is this: ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Square Principle
In mathematical set theory, a square principle is a combinatorial principle asserting the existence of a cohering sequence of short closed unbounded (club) sets so that no one (long) club set coheres with them all. As such they may be viewed as a kind of incompactness phenomenon. They were introduced by Ronald Jensen in his analysis of the fine structure of the constructible universe L. Definition Define Sing to be the class of all limit ordinal In set theory, a limit ordinal is an ordinal number that is neither zero nor a successor ordinal. Alternatively, an ordinal λ is a limit ordinal if there is an ordinal less than λ, and whenever β is an ordinal less than λ, then there exists a ...s which are not regular. ''Global square'' states that there is a system (C_\beta)_ satisfying: # C_\beta is a club set of \beta. # ot(C_\beta) < \beta # If is a limit point of then and |
Inner Model
In set theory, a branch of mathematical logic, an inner model for a theory ''T'' is a substructure of a model ''M'' of a set theory that is both a model for ''T'' and contains all the ordinals of ''M''. Definition Let L = \langle \in \rangle be the language of set theory. Let ''S'' be a particular set theory, for example the ZFC axioms and let ''T'' (possibly the same as ''S'') also be a theory in L. If ''M'' is a model for ''S'', and ''N'' is an L-structure such that #''N'' is a substructure of ''M'', i.e. the interpretation \in_N of \in in ''N'' is \cap N^2 #''N'' is a model for ''T'' #the domain of ''N'' is a transitive class of ''M'' #''N'' contains all ordinals of ''M'' then we say that ''N'' is an inner model of ''T'' (in ''M''). Usually ''T'' will equal (or subsume) ''S'', so that ''N'' is a model for ''S'' 'inside' the model ''M'' of ''S''. If only conditions 1 and 2 hold, ''N'' is called a standard model of ''T'' (in ''M''), a standard submodel of ''T'' (if ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
