Lorenz J. Halbeisen

Combinatorial Set Theory (eBook, PDF)

With a Gentle Introduction to Forcing

• Format: PDF

Produktbeschreibung

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.

Produktdetails

• Verlag: Springer International Publishing / Springer-Verlag London
• Erscheinungstermin: 20. Dezember 2017
• Englisch
• ISBN-13: 9783319602318
• Artikelnr.: 53061617

Inhaltsangabe

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.- Suite.

---

Overture: Ramsey's Theorem.- The Axioms of Zermelo-Fraenkel Set Theory.- Cardinal Relations in ZF only.- The Axiom of Choice.- How to Make Two Balls from One.- Models of Set Theory with Atoms.- Twelve 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.- Models of Finite Fragments of Set Theory.- Proving Unprovability.- Models in which AC Fails.- Combining Forcing Notions.- Models in which p = c.- Properties of Forcing Extensions.- Cogen Forcing Revisited.- Silver-Like Forcing Notions.- Miller Forcing.- Mathias Forcing.- On the Existence of Ramsey Ultrafilters.- Combinatorial Properties of Sets of Partitions.- Suite.

Rezensionen

From the reviews: "This book provides a self-contained introduction to axiomatic set theory with main focus on infinitary combinatorics and the forcing technique. It is intended as a textbook in courses as well as for self-study. ... The author gives the historical background and the sources of the main results in the Notes of each chapter. He also gives hints for further studies in his sections 'Related results'." (Martin Weese, Zentralblatt MATH, Vol. 1237, 2012)

"Each chapter ends with Notes that often add historical information, offer further remarks on the chapter's contents ... . Halbheisen's Combinatorial Set Theory is an excellent source for the intermediate or advanced student of set theory ... Because of its wealth of material, it should also serve as an excellent resource for those designing advanced courses or searching for seminar assignments for students." (J. M. Plotkin, zbMATH 06755662, 2018)