|
The Higher Infinite
''The Higher Infinite: Large Cardinals in Set Theory from their Beginnings'' is a monograph in set theory by Akihiro Kanamori, concerning the history and theory of large cardinals, infinite sets characterized by such strong properties that their existence cannot be proven in Zermelo–Fraenkel set theory (ZFC). This book was published in 1994 by Springer-Verlag in their series Perspectives in Mathematical Logic, with a second edition in 2003 in their Springer Monographs in Mathematics series, and a paperback reprint of the second edition in 2009 (). Topics Not counting introductory material and appendices, there are six chapters in ''The Higher Infinite'', arranged roughly in chronological order by the history of the development of the subject. The author writes that he chose this ordering "both because it provides the most coherent exposition of the mathematics and because it holds the key to any epistemological concerns". In the first chapter, "Beginnings", the material includes ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Monograph
A monograph is a specialist work of writing (in contrast to reference works) or exhibition on a single subject or an aspect of a subject, often by a single author or artist, and usually on a scholarly subject. In library cataloging, ''monograph'' has a broader meaning—that of a nonserial publication complete in one volume (book) or a definite number of volumes. Thus it differs from a serial or periodical publication such as a magazine, academic journal, or newspaper. In this context only, books such as novels are considered monographs.__FORCETOC__ Academia The English term "monograph" is derived from modern Latin "monographia", which has its root in Greek. In the English word, "mono-" means "single" and "-graph" means "something written". Unlike a textbook, which surveys the state of knowledge in a field, the main purpose of a monograph is to present primary research and original scholarship ascertaining reliable credibility to the required recipient. This research is prese ... [...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] |
Descriptive Set Theory
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. Polish spaces Descriptive set theory begins with the study of Polish spaces and their Borel sets. A Polish space is a second-countable topological space that is metrizable with a complete metric. Heuristically, it is a complete separable metric space whose metric has been "forgotten". Examples include the real line \mathbb, the Baire space \mathcal, the Cantor space \mathcal, and the Hilbert cube I^. Universality properties The class of Polish spaces has several universality properties, which show that there is no loss of generality in considering Polish spaces of certain restricted form ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Paul Cohen
Paul Joseph Cohen (April 2, 1934 – March 23, 2007) was an American mathematician. He is best known for his proofs that the continuum hypothesis and the axiom of choice are independent from Zermelo–Fraenkel set theory, for which he was awarded a Fields Medal. Early life and education Cohen was born in Long Branch, New Jersey, into a Jewish family that had immigrated to the United States from what is now Poland; he grew up in Brooklyn.. He graduated in 1950, at age 16, from Stuyvesant High School in New York City. Cohen next studied at the Brooklyn College from 1950 to 1953, but he left without earning his bachelor's degree when he learned that he could start his graduate studies at the University of Chicago with just two years of college. At Chicago, Cohen completed his master's degree in mathematics in 1954 and his Doctor of Philosophy degree in 1958, under supervision of Antoni Zygmund. The title of his doctoral thesis was ''Topics in the Theory of Uniqueness of Trigonome ... [...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] |
Rowbottom Cardinal
In set theory, a Rowbottom cardinal, introduced by , is a certain kind of large cardinal number. An uncountable cardinal number \kappa is said to be ''\lambda- Rowbottom'' if for every function ''f'': kappa;sup><ω → λ (where λ < κ) there is a set ''H'' of order type that is quasi- for ''f'', i.e., for every ''n'', the ''f''-image of the set of ''n''-element subsets of ''H'' has < elements. is ''Rowbottom'' if it is '' - Rowbottom''. Every is Rowbottom, and every Rowbottom cardinal is |
Jónsson Cardinal
In set theory, a Jónsson cardinal (named after Bjarni Jónsson) is a certain kind of large cardinal number. An uncountable cardinal number κ is said to be ''Jónsson'' if for every function ''f'': sup><ω → κ there is a set ''H'' of order type κ such that for each ''n'', ''f'' restricted to ''n''-element subsets of ''H'' omits at least one value in κ. Every is Jónsson. By a theorem of Eugene M. Kleinberg, the theories ZFC + “there is a ” and ZFC + “there is a Jónsson cardinal” are equiconsistent. |
Indiscernibles
In mathematical logic, indiscernibles are objects that cannot be distinguished by any property or relation defined by a formula. Usually only first-order formulas are considered. Examples If ''a'', ''b'', and ''c'' are distinct and is a set of indiscernibles, then, for example, for each binary formula \beta , we must have : \beta (a, b) \land \beta (b, a) \land \beta (a, c) \land \beta (c, a) \land \beta (b, c) \land \beta (c, b) \lor \lnot \beta (a, b) \land \lnot \beta (b, a) \land \lnot \beta(a, c) \land \lnot \beta (c, a) \land \lnot \beta (b, c) \land \lnot \beta (c, b) \,. Historically, the identity of indiscernibles was one of the laws of thought of Gottfried Leibniz. Generalizations In some contexts one considers the more general notion of order-indiscernibles, and the term sequence of indiscernibles often refers implicitly to this weaker notion. In our example of binary formulas, to say that the triple (''a'', ''b'', ''c'') of distinct elements is a sequence of ind ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
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] |
Model Theory
In mathematical logic, model theory is the study of the relationship between formal theories (a collection of sentences in a formal language expressing statements about a mathematical structure), and their models (those structures in which the statements of the theory hold). The aspects investigated include the number and size of models of a theory, the relationship of different models to each other, and their interaction with the formal language itself. In particular, model theorists also investigate the sets that can be defined in a model of a theory, and the relationship of such definable sets to each other. As a separate discipline, model theory goes back to Alfred Tarski, who first used the term "Theory of Models" in publication in 1954. Since the 1970s, the subject has been shaped decisively by Saharon Shelah's stability theory. Compared to other areas of mathematical logic such as proof theory, model theory is often less concerned with formal rigour and closer in spirit ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Aronszajn Tree
In set theory, an Aronszajn tree is a tree of uncountable height with no uncountable branches and no uncountable levels. For example, every Suslin tree is an Aronszajn tree. More generally, for a cardinal ''κ'', a ''κ''-Aronszajn tree is a tree of height ''κ'' in which all levels have size less than ''κ'' and all branches have height less than ''κ'' (so Aronszajn trees are the same as \aleph_1-Aronszajn trees). They are named for Nachman Aronszajn, who constructed an Aronszajn tree in 1934; his construction was described by . A cardinal ''κ'' for which no ''κ''-Aronszajn trees exist is said to have the tree property (sometimes the condition that ''κ'' is regular and uncountable is included). Existence of κ-Aronszajn trees Kőnig's lemma states that \aleph_0-Aronszajn trees do not exist. The existence of Aronszajn trees (=\aleph_1-Aronszajn trees) was proven by Nachman Aronszajn, and implies that the analogue of Kőnig's lemma does not hold for uncountable trees. Th ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Tree (set Theory)
In set theory, a tree is a partially ordered set (''T'', <) such that for each ''t'' ∈ ''T'', the set is by the relation <. Frequently trees are assumed to have only one root (i.e. ), as the typical questions investigated in this field are easily reduced to questions about single-rooted trees. Definition A tree is a (poset) (''T'', <) such that for each ''t'' ∈ ''T'', the set is by the ...[...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |