Nicht aus der Schweiz? Besuchen Sie lehmanns.de
Combinatorial Set Theory - Lorenz J. Halbeisen

Combinatorial Set Theory

With a Gentle Introduction to Forcing
Buch | Hardcover
XVI, 594 Seiten
2018 | 2nd ed. 2017
Springer International Publishing (Verlag)
978-3-319-60230-1 (ISBN)
CHF 239,65 inkl. MwSt
  • Versand in 10-15 Tagen
  • Versandkostenfrei
  • Auch auf Rechnung
  • Artikel merken
This introduction to modern set theory opens the way to advanced current research. Coverage includes the axiom of choice and Ramsey theory, and a detailed explanation of the sophisticated technique of forcing. Offers notes, related results and references.
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.

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.

"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)

“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)

Erscheinungsdatum
Reihe/Serie Springer Monographs in Mathematics
Zusatzinfo XVI, 594 p. 20 illus.
Verlagsort Cham
Sprache englisch
Maße 155 x 235 mm
Gewicht 1070 g
Themenwelt Mathematik / Informatik Mathematik Allgemeines / Lexika
Mathematik / Informatik Mathematik Graphentheorie
Mathematik / Informatik Mathematik Logik / Mengenlehre
Schlagworte 0 (Null) • Axiom of choice • Banach-Tarski paradox • cardinal characteristics • combinatorics • combinatorics & graph theory • Combinatorics & graph theory • Combinatorics of Forcing • forcing constructions • forcing technique • Infinite Combinatorics • Martin's axiom • Mathematical Foundations • Mathematical Logic • Mathematical Logic and Foundations • Mathematics • mathematics and statistics • MSC (2010): 03E35, 03E17, 03E25, 05D10, 03E30, 03E • MSC (2010): 03E35, 03E17, 03E25, 05D10, 03E30, 03E50, 03E05 • .NET Enterprise Servers • .NET Framework • .NET Mobile Information Server • .NET My Services • .NET Remoting • .NET Windows Forms • permutation models • Ramsey theory • Ramsey ultrafilters • set theory • Suslin's problem
ISBN-10 3-319-60230-6 / 3319602306
ISBN-13 978-3-319-60230-1 / 9783319602301
Zustand Neuware
Haben Sie eine Frage zum Produkt?
Mehr entdecken
aus dem Bereich