Combinatorial Set Theory : With a Gentle Introduction to Forcing / by Lorenz J. Halbeisen

By:

Halbeisen, Lorenz J [aut]

Resource type: Ressourcentyp: Buch (Online)Book (Online)Language: English Series: Springer Monographs in Mathematics | SpringerLink BücherPublisher: Cham : Springer, 2017Edition: 2nd ed. 2017Description: Online-Ressource (XVI, 594 p. 20 illus, online resource)ISBN:

9783319602318

Subject(s):

Additional physical formats: 9783319602301 | Erscheint auch als: 978-3-319-60230-1 Druck-AusgabeMSC: MSC: *03-01 | 03Exx | 05D10LOC classification:

QA8.9-10.3

DOI: DOI: 10.1007/978-3-319-60231-8Online resources:

Summary: The Setting -- First-Order Logic in a Nutshell -- Axioms of Set Theory -- Overture: Ramsey's Theorem -- Cardinal Relations in ZF Only -- Forms of Choice -- How to Make Two Balls from One -- Models of Set Theory with Atoms -- Thirteen Cardinals and Their Relations -- The Shattering Number Revisited -- Happy Families and Their Relatives -- Coda: A Dual Form of Ramsey’s Theorem -- The Idea of Forcing -- Martin's Axiom -- The Notion of Forcing -- Proving Unprovability -- Models in Which AC Fails -- Combining Forcing Notions -- Models in Which p=c -- Suslin’s Problem -- Properties of Forcing Extensions -- Cohen Forcing Revisited -- Sacks Forcing -- Silver-Like Forcing Notions -- Miller Forcing -- Mathias Forcing -- How Many Ramsey Ultrafilters Exist? -- Combinatorial Properties of Sets of Partitions -- SuiteSummary: 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-studyPPN: PPN: 165861996XPackage identifier: Produktsigel: ZDB-2-SEB | ZDB-2-SXMS | ZDB-2-SMA

Holdings ( 0 )

No physical items for this record