Combinatorial set theory : with a gentle introduction to forcing
著者
書誌事項
Combinatorial set theory : with a gentle introduction to forcing
（Springer monographs in mathematics）
Springer, c2012
- : pbk
大学図書館所蔵 全23件
注記
Includes bibliographical references and indexes
"Softcover reprint of the hardcover 1st edition 2012"--T.p. verso of paperback edition
内容説明・目次
内容説明
This book provides a self-contained introduction to modern set theory and also opens up some more advanced areas of current research in this field. The first part offers an overview of classical set theory wherein the focus lies on the axiom of choice and Ramsey theory. In the second part, the sophisticated technique of forcing, originally developed by Paul Cohen, is explained in great detail. With this technique, one can show that certain statements, like the continuum hypothesis, are neither provable nor disprovable from the axioms of set theory. In the last part, some topics of classical set theory are revisited and further developed in the light of forcing. The notes at the end of each chapter put the results in a historical context, and the numerous related results and the extensive list of references lead the reader to the frontier of research. This book will appeal to all mathematicians interested in the foundations of mathematics, but will be of particular use to graduates in this field.
目次
The Setting.- 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.- Cohen Forcing Revisited.- Silver-Like Forcing Notions.- Miller Forcing.- Mathias Forcing.- On the Existence of Ramsey Ultrafilters.- Combinatorial Properties of Sets of Partitions.- Suite.
「Nielsen BookData」 より