Author: Nik Weaver
Publisher: World Scientific
ISBN: 9814566020
Category : Mathematics
Languages : en
Pages : 153
Book Description
Ever since Paul Cohen's spectacular use of the forcing concept to prove the independence of the continuum hypothesis from the standard axioms of set theory, forcing has been seen by the general mathematical community as a subject of great intrinsic interest but one that is technically so forbidding that it is only accessible to specialists. In the past decade, a series of remarkable solutions to long-standing problems in C*-algebra using set-theoretic methods, many achieved by the author and his collaborators, have generated new interest in this subject. This is the first book aimed at explaining forcing to general mathematicians. It simultaneously makes the subject broadly accessible by explaining it in a clear, simple manner, and surveys advanced applications of set theory to mainstream topics.
Forcing For Mathematicians
Author: Nik Weaver
Publisher: World Scientific
ISBN: 9814566020
Category : Mathematics
Languages : en
Pages : 153
Book Description
Ever since Paul Cohen's spectacular use of the forcing concept to prove the independence of the continuum hypothesis from the standard axioms of set theory, forcing has been seen by the general mathematical community as a subject of great intrinsic interest but one that is technically so forbidding that it is only accessible to specialists. In the past decade, a series of remarkable solutions to long-standing problems in C*-algebra using set-theoretic methods, many achieved by the author and his collaborators, have generated new interest in this subject. This is the first book aimed at explaining forcing to general mathematicians. It simultaneously makes the subject broadly accessible by explaining it in a clear, simple manner, and surveys advanced applications of set theory to mainstream topics.
Publisher: World Scientific
ISBN: 9814566020
Category : Mathematics
Languages : en
Pages : 153
Book Description
Ever since Paul Cohen's spectacular use of the forcing concept to prove the independence of the continuum hypothesis from the standard axioms of set theory, forcing has been seen by the general mathematical community as a subject of great intrinsic interest but one that is technically so forbidding that it is only accessible to specialists. In the past decade, a series of remarkable solutions to long-standing problems in C*-algebra using set-theoretic methods, many achieved by the author and his collaborators, have generated new interest in this subject. This is the first book aimed at explaining forcing to general mathematicians. It simultaneously makes the subject broadly accessible by explaining it in a clear, simple manner, and surveys advanced applications of set theory to mainstream topics.
Classical Descriptive Set Theory
Author: Alexander Kechris
Publisher: Springer Science & Business Media
ISBN: 1461241901
Category : Mathematics
Languages : en
Pages : 419
Book Description
Descriptive set theory has been one of the main areas of research in set theory for almost a century. This text presents a largely balanced approach to the subject, which combines many elements of the different traditions. It includes a wide variety of examples, more than 400 exercises, and applications, in order to illustrate the general concepts and results of the theory.
Publisher: Springer Science & Business Media
ISBN: 1461241901
Category : Mathematics
Languages : en
Pages : 419
Book Description
Descriptive set theory has been one of the main areas of research in set theory for almost a century. This text presents a largely balanced approach to the subject, which combines many elements of the different traditions. It includes a wide variety of examples, more than 400 exercises, and applications, in order to illustrate the general concepts and results of the theory.
Handbook of Set Theory
Author: Matthew Foreman
Publisher: Springer Science & Business Media
ISBN: 1402057644
Category : Mathematics
Languages : en
Pages : 2200
Book Description
Numbers imitate space, which is of such a di?erent nature —Blaise Pascal It is fair to date the study of the foundation of mathematics back to the ancient Greeks. The urge to understand and systematize the mathematics of the time led Euclid to postulate axioms in an early attempt to put geometry on a ?rm footing. With roots in the Elements, the distinctive methodology of mathematics has become proof. Inevitably two questions arise: What are proofs? and What assumptions are proofs based on? The ?rst question, traditionally an internal question of the ?eld of logic, was also wrestled with in antiquity. Aristotle gave his famous syllogistic s- tems, and the Stoics had a nascent propositional logic. This study continued with ?ts and starts, through Boethius, the Arabs and the medieval logicians in Paris and London. The early germs of logic emerged in the context of philosophy and theology. The development of analytic geometry, as exempli?ed by Descartes, ill- tratedoneofthedi?cultiesinherentinfoundingmathematics. Itisclassically phrased as the question ofhow one reconciles the arithmetic with the geom- ric. Arenumbers onetypeofthingand geometricobjectsanother? Whatare the relationships between these two types of objects? How can they interact? Discovery of new types of mathematical objects, such as imaginary numbers and, much later, formal objects such as free groups and formal power series make the problem of ?nding a common playing ?eld for all of mathematics importunate. Several pressures made foundational issues urgent in the 19th century.
Publisher: Springer Science & Business Media
ISBN: 1402057644
Category : Mathematics
Languages : en
Pages : 2200
Book Description
Numbers imitate space, which is of such a di?erent nature —Blaise Pascal It is fair to date the study of the foundation of mathematics back to the ancient Greeks. The urge to understand and systematize the mathematics of the time led Euclid to postulate axioms in an early attempt to put geometry on a ?rm footing. With roots in the Elements, the distinctive methodology of mathematics has become proof. Inevitably two questions arise: What are proofs? and What assumptions are proofs based on? The ?rst question, traditionally an internal question of the ?eld of logic, was also wrestled with in antiquity. Aristotle gave his famous syllogistic s- tems, and the Stoics had a nascent propositional logic. This study continued with ?ts and starts, through Boethius, the Arabs and the medieval logicians in Paris and London. The early germs of logic emerged in the context of philosophy and theology. The development of analytic geometry, as exempli?ed by Descartes, ill- tratedoneofthedi?cultiesinherentinfoundingmathematics. Itisclassically phrased as the question ofhow one reconciles the arithmetic with the geom- ric. Arenumbers onetypeofthingand geometricobjectsanother? Whatare the relationships between these two types of objects? How can they interact? Discovery of new types of mathematical objects, such as imaginary numbers and, much later, formal objects such as free groups and formal power series make the problem of ?nding a common playing ?eld for all of mathematics importunate. Several pressures made foundational issues urgent in the 19th century.
Geometric Set Theory
Author: Paul B. Larson
Publisher: American Mathematical Soc.
ISBN: 1470454629
Category : Education
Languages : en
Pages : 345
Book Description
This book introduces a new research direction in set theory: the study of models of set theory with respect to their extensional overlap or disagreement. In Part I, the method is applied to isolate new distinctions between Borel equivalence relations. Part II contains applications to independence results in Zermelo–Fraenkel set theory without Axiom of Choice. The method makes it possible to classify in great detail various paradoxical objects obtained using the Axiom of Choice; the classifying criterion is a ZF-provable implication between the existence of such objects. The book considers a broad spectrum of objects from analysis, algebra, and combinatorics: ultrafilters, Hamel bases, transcendence bases, colorings of Borel graphs, discontinuous homomorphisms between Polish groups, and many more. The topic is nearly inexhaustible in its variety, and many directions invite further investigation.
Publisher: American Mathematical Soc.
ISBN: 1470454629
Category : Education
Languages : en
Pages : 345
Book Description
This book introduces a new research direction in set theory: the study of models of set theory with respect to their extensional overlap or disagreement. In Part I, the method is applied to isolate new distinctions between Borel equivalence relations. Part II contains applications to independence results in Zermelo–Fraenkel set theory without Axiom of Choice. The method makes it possible to classify in great detail various paradoxical objects obtained using the Axiom of Choice; the classifying criterion is a ZF-provable implication between the existence of such objects. The book considers a broad spectrum of objects from analysis, algebra, and combinatorics: ultrafilters, Hamel bases, transcendence bases, colorings of Borel graphs, discontinuous homomorphisms between Polish groups, and many more. The topic is nearly inexhaustible in its variety, and many directions invite further investigation.
Set Theory
Author: Thomas Jech
Publisher: Springer Science & Business Media
ISBN: 3662224003
Category : Mathematics
Languages : en
Pages : 642
Book Description
The main body of this book consists of 106 numbered theorems and a dozen of examples of models of set theory. A large number of additional results is given in the exercises, which are scattered throughout the text. Most exer cises are provided with an outline of proof in square brackets [ ], and the more difficult ones are indicated by an asterisk. I am greatly indebted to all those mathematicians, too numerous to men tion by name, who in their letters, preprints, handwritten notes, lectures, seminars, and many conversations over the past decade shared with me their insight into this exciting subject. XI CONTENTS Preface xi PART I SETS Chapter 1 AXIOMATIC SET THEORY I. Axioms of Set Theory I 2. Ordinal Numbers 12 3. Cardinal Numbers 22 4. Real Numbers 29 5. The Axiom of Choice 38 6. Cardinal Arithmetic 42 7. Filters and Ideals. Closed Unbounded Sets 52 8. Singular Cardinals 61 9. The Axiom of Regularity 70 Appendix: Bernays-Godel Axiomatic Set Theory 76 Chapter 2 TRANSITIVE MODELS OF SET THEORY 10. Models of Set Theory 78 II. Transitive Models of ZF 87 12. Constructible Sets 99 13. Consistency of the Axiom of Choice and the Generalized Continuum Hypothesis 108 14. The In Hierarchy of Classes, Relations, and Functions 114 15. Relative Constructibility and Ordinal Definability 126 PART II MORE SETS Chapter 3 FORCING AND GENERIC MODELS 16. Generic Models 137 17. Complete Boolean Algebras 144 18.
Publisher: Springer Science & Business Media
ISBN: 3662224003
Category : Mathematics
Languages : en
Pages : 642
Book Description
The main body of this book consists of 106 numbered theorems and a dozen of examples of models of set theory. A large number of additional results is given in the exercises, which are scattered throughout the text. Most exer cises are provided with an outline of proof in square brackets [ ], and the more difficult ones are indicated by an asterisk. I am greatly indebted to all those mathematicians, too numerous to men tion by name, who in their letters, preprints, handwritten notes, lectures, seminars, and many conversations over the past decade shared with me their insight into this exciting subject. XI CONTENTS Preface xi PART I SETS Chapter 1 AXIOMATIC SET THEORY I. Axioms of Set Theory I 2. Ordinal Numbers 12 3. Cardinal Numbers 22 4. Real Numbers 29 5. The Axiom of Choice 38 6. Cardinal Arithmetic 42 7. Filters and Ideals. Closed Unbounded Sets 52 8. Singular Cardinals 61 9. The Axiom of Regularity 70 Appendix: Bernays-Godel Axiomatic Set Theory 76 Chapter 2 TRANSITIVE MODELS OF SET THEORY 10. Models of Set Theory 78 II. Transitive Models of ZF 87 12. Constructible Sets 99 13. Consistency of the Axiom of Choice and the Generalized Continuum Hypothesis 108 14. The In Hierarchy of Classes, Relations, and Functions 114 15. Relative Constructibility and Ordinal Definability 126 PART II MORE SETS Chapter 3 FORCING AND GENERIC MODELS 16. Generic Models 137 17. Complete Boolean Algebras 144 18.
The Calculus of One-Sided $M$-Ideals and Multipliers in Operator Spaces
Author: David P. Blecher
Publisher: American Mathematical Soc.
ISBN: 0821838237
Category : Mathematics
Languages : en
Pages : 102
Book Description
The theory of one-sided $M$-ideals and multipliers of operator spaces is simultaneously a generalization of classical $M$-ideals, ideals in operator algebras, and aspects of the theory of Hilbert $C*$-modules and their maps. Here we give a systematic exposition of this theory. The main part of this memoir consists of a 'calculus' for one-sided $M$-ideals and multipliers, i.e. a collection of the properties of one-sided $M$-ideals and multipliers with respect to the basic constructions met in functional analysis. This is intended to be a reference tool for 'noncommutative functional analysts' who may encounter a one-sided $M$-ideal or multiplier in their work.
Publisher: American Mathematical Soc.
ISBN: 0821838237
Category : Mathematics
Languages : en
Pages : 102
Book Description
The theory of one-sided $M$-ideals and multipliers of operator spaces is simultaneously a generalization of classical $M$-ideals, ideals in operator algebras, and aspects of the theory of Hilbert $C*$-modules and their maps. Here we give a systematic exposition of this theory. The main part of this memoir consists of a 'calculus' for one-sided $M$-ideals and multipliers, i.e. a collection of the properties of one-sided $M$-ideals and multipliers with respect to the basic constructions met in functional analysis. This is intended to be a reference tool for 'noncommutative functional analysts' who may encounter a one-sided $M$-ideal or multiplier in their work.
Generalized Descriptive Set Theory and Classification Theory
Author: Sy-David Friedman
Publisher: American Mathematical Soc.
ISBN: 0821894757
Category : Mathematics
Languages : en
Pages : 92
Book Description
Descriptive set theory is mainly concerned with studying subsets of the space of all countable binary sequences. In this paper the authors study the generalization where countable is replaced by uncountable. They explore properties of generalized Baire and Cantor spaces, equivalence relations and their Borel reducibility. The study shows that the descriptive set theory looks very different in this generalized setting compared to the classical, countable case. They also draw the connection between the stability theoretic complexity of first-order theories and the descriptive set theoretic complexity of their isomorphism relations. The authors' results suggest that Borel reducibility on uncountable structures is a model theoretically natural way to compare the complexity of isomorphism relations.
Publisher: American Mathematical Soc.
ISBN: 0821894757
Category : Mathematics
Languages : en
Pages : 92
Book Description
Descriptive set theory is mainly concerned with studying subsets of the space of all countable binary sequences. In this paper the authors study the generalization where countable is replaced by uncountable. They explore properties of generalized Baire and Cantor spaces, equivalence relations and their Borel reducibility. The study shows that the descriptive set theory looks very different in this generalized setting compared to the classical, countable case. They also draw the connection between the stability theoretic complexity of first-order theories and the descriptive set theoretic complexity of their isomorphism relations. The authors' results suggest that Borel reducibility on uncountable structures is a model theoretically natural way to compare the complexity of isomorphism relations.
Canonical Ramsey Theory on Polish Spaces
Author: Vladimir Kanovei
Publisher: Cambridge University Press
ISBN: 1107434335
Category : Mathematics
Languages : en
Pages : 279
Book Description
This book lays the foundations for an exciting new area of research in descriptive set theory. It develops a robust connection between two active topics: forcing and analytic equivalence relations. This in turn allows the authors to develop a generalization of classical Ramsey theory. Given an analytic equivalence relation on a Polish space, can one find a large subset of the space on which it has a simple form? The book provides many positive and negative general answers to this question. The proofs feature proper forcing and Gandy–Harrington forcing, as well as partition arguments. The results include strong canonization theorems for many classes of equivalence relations and sigma-ideals, as well as ergodicity results in cases where canonization theorems are impossible to achieve. Ideal for graduate students and researchers in set theory, the book provides a useful springboard for further research.
Publisher: Cambridge University Press
ISBN: 1107434335
Category : Mathematics
Languages : en
Pages : 279
Book Description
This book lays the foundations for an exciting new area of research in descriptive set theory. It develops a robust connection between two active topics: forcing and analytic equivalence relations. This in turn allows the authors to develop a generalization of classical Ramsey theory. Given an analytic equivalence relation on a Polish space, can one find a large subset of the space on which it has a simple form? The book provides many positive and negative general answers to this question. The proofs feature proper forcing and Gandy–Harrington forcing, as well as partition arguments. The results include strong canonization theorems for many classes of equivalence relations and sigma-ideals, as well as ergodicity results in cases where canonization theorems are impossible to achieve. Ideal for graduate students and researchers in set theory, the book provides a useful springboard for further research.
Combinatorial Set Theory
Author: Lorenz J. Halbeisen
Publisher: Springer
ISBN: 3319602314
Category : Mathematics
Languages : en
Pages : 586
Book Description
This book, now in a thoroughly revised second edition, provides a comprehensive and accessible introduction to modern set theory. Following an overview of basic notions in combinatorics and first-order logic, the author outlines the main topics of classical set theory in the second part, including Ramsey theory and the axiom of choice. The revised edition contains new permutation models and recent results in set theory without the axiom of choice. The third part explains the sophisticated technique of forcing in great detail, now including a separate chapter on Suslin’s problem. The technique is used to show that certain statements are neither provable nor disprovable from the axioms of set theory. In the final part, some topics of classical set theory are revisited and further developed in light of forcing, with new chapters on Sacks Forcing and Shelah’s astonishing construction of a model with finitely many Ramsey ultrafilters. Written for graduate students in axiomatic set theory, Combinatorial Set Theory will appeal to all researchers interested in the foundations of mathematics. With extensive reference lists and historical remarks at the end of each chapter, this book is suitable for self-study.
Publisher: Springer
ISBN: 3319602314
Category : Mathematics
Languages : en
Pages : 586
Book Description
This book, now in a thoroughly revised second edition, provides a comprehensive and accessible introduction to modern set theory. Following an overview of basic notions in combinatorics and first-order logic, the author outlines the main topics of classical set theory in the second part, including Ramsey theory and the axiom of choice. The revised edition contains new permutation models and recent results in set theory without the axiom of choice. The third part explains the sophisticated technique of forcing in great detail, now including a separate chapter on Suslin’s problem. The technique is used to show that certain statements are neither provable nor disprovable from the axioms of set theory. In the final part, some topics of classical set theory are revisited and further developed in light of forcing, with new chapters on Sacks Forcing and Shelah’s astonishing construction of a model with finitely many Ramsey ultrafilters. Written for graduate students in axiomatic set theory, Combinatorial Set Theory will appeal to all researchers interested in the foundations of mathematics. With extensive reference lists and historical remarks at the end of each chapter, this book is suitable for self-study.
Forcing Idealized
Author: Jindrich Zapletal
Publisher: Cambridge University Press
ISBN: 113946826X
Category : Mathematics
Languages : en
Pages : 7
Book Description
Descriptive set theory and definable proper forcing are two areas of set theory that developed quite independently of each other. This monograph unites them and explores the connections between them. Forcing is presented in terms of quotient algebras of various natural sigma-ideals on Polish spaces, and forcing properties in terms of Fubini-style properties or in terms of determined infinite games on Boolean algebras. Many examples of forcing notions appear, some newly isolated from measure theory, dynamical systems, and other fields. The descriptive set theoretic analysis of operations on forcings opens the door to applications of the theory: absoluteness theorems for certain classical forcing extensions, duality theorems, and preservation theorems for the countable support iteration. Containing original research, this text highlights the connections that forcing makes with other areas of mathematics, and is essential reading for academic researchers and graduate students in set theory, abstract analysis and measure theory.
Publisher: Cambridge University Press
ISBN: 113946826X
Category : Mathematics
Languages : en
Pages : 7
Book Description
Descriptive set theory and definable proper forcing are two areas of set theory that developed quite independently of each other. This monograph unites them and explores the connections between them. Forcing is presented in terms of quotient algebras of various natural sigma-ideals on Polish spaces, and forcing properties in terms of Fubini-style properties or in terms of determined infinite games on Boolean algebras. Many examples of forcing notions appear, some newly isolated from measure theory, dynamical systems, and other fields. The descriptive set theoretic analysis of operations on forcings opens the door to applications of the theory: absoluteness theorems for certain classical forcing extensions, duality theorems, and preservation theorems for the countable support iteration. Containing original research, this text highlights the connections that forcing makes with other areas of mathematics, and is essential reading for academic researchers and graduate students in set theory, abstract analysis and measure theory.