東華大學圖書館 |

Language: English

Help

回圖書館首頁

手機版館藏查詢

Back

Switch To: Labeled | MARC Mode | ISBD

Combinatorial set theory = with a ge...

Halbeisen, Lorenz J.

Linked to FindBook

Google Book

Amazon

博客來

Combinatorial set theory = with a gentle introduction to forcing /

Record Type:	Electronic resources : Monograph/item
Title/Author:	Combinatorial set theory/ by Lorenz J. Halbeisen.
Reminder of title:	with a gentle introduction to forcing /
Author:	Halbeisen, Lorenz J.
Published:	Cham :Springer Nature Switzerland : : 2025.,
Description:	xvii, 616 p. :ill., digital ;24 cm.
[NT 15003449]:	Part I: Preliminary -- 1 The Setting -- 2 First-Order Logic in a Nutshell -- 3 Axioms of Set Theory -- Part II: Topics in Combinatorial Set Theory -- 4 Overture: Ramsey's Theorem -- 5 Cardinal Relations in ZF Only -- 6 Forms of Choice -- 7 How to Make Two Balls from One -- 8 Models of Set Theory with Atoms -- 9 Thirteen Cardinals and Their Relations -- 10 The Shattering Number Revisited -- 11 Happy Families and Their Relatives -- 12 Coda: A Dual Form of Ramsey's Theorem -- Part III: From Martin's Axiom to Cohen's Forcing -- 13 The Idea of Forcing -- 14 Martin's Axiom -- 15 The Notion of Forcing -- 16 Proving Unprovability -- 17 Models in Which AC Fails -- 18 Combining Forcing Notions -- 19 Models in Which p=c -- 20 Suslin's Problem -- Part IV: Combinatorics of Forcing Extensions -- 21 Properties of Forcing Extensions -- 22 Cohen Forcing Revisited -- 23 Sacks Forcing -- 24 Silver-Like Forcing Notions -- 25 Miller Forcing -- 26 Mathias Forcing -- 27 Laver Forcing -- 28 How Many Ramsey Ultrafilters Exist? -- 29 Suite.
Contained By:	Springer Nature eBook
Subject:	Combinatorial set theory. -
Online resource:	https://doi.org/10.1007/978-3-031-91752-3
ISBN:	9783031917523

Combinatorial set theory = with a gentle introduction to forcing /
Halbeisen, Lorenz J.

Combinatorial set theorywith a gentle introduction to forcing /[electronic resource] :by Lorenz J. Halbeisen. - Third edition. - Cham :Springer Nature Switzerland :2025. - xvii, 616 p. :ill., digital ;24 cm. - Springer monographs in mathematics,2196-9922. - Springer monographs in mathematics..

Part I: Preliminary -- 1 The Setting -- 2 First-Order Logic in a Nutshell -- 3 Axioms of Set Theory -- Part II: Topics in Combinatorial Set Theory -- 4 Overture: Ramsey's Theorem -- 5 Cardinal Relations in ZF Only -- 6 Forms of Choice -- 7 How to Make Two Balls from One -- 8 Models of Set Theory with Atoms -- 9 Thirteen Cardinals and Their Relations -- 10 The Shattering Number Revisited -- 11 Happy Families and Their Relatives -- 12 Coda: A Dual Form of Ramsey's Theorem -- Part III: From Martin's Axiom to Cohen's Forcing -- 13 The Idea of Forcing -- 14 Martin's Axiom -- 15 The Notion of Forcing -- 16 Proving Unprovability -- 17 Models in Which AC Fails -- 18 Combining Forcing Notions -- 19 Models in Which p=c -- 20 Suslin's Problem -- Part IV: Combinatorics of Forcing Extensions -- 21 Properties of Forcing Extensions -- 22 Cohen Forcing Revisited -- 23 Sacks Forcing -- 24 Silver-Like Forcing Notions -- 25 Miller Forcing -- 26 Mathias Forcing -- 27 Laver Forcing -- 28 How Many Ramsey Ultrafilters Exist? -- 29 Suite.

This book, now in a revised and extended third edition, provides a comprehensive and accessible introduction to modern axiomatic set theory. After an overview of basic notions in combinatorics and first-order logic, and discussing in great detail the axioms of set theory, the author outlines in the second part the main topics of classical set theory, including Ramsey theory and the axiom of choice. As an application of the axiom of choice, a complete proof of Robinson's construction for doubling a ball by dividing it into only five parts is given. For the new edition, the chapter on permutation models has been extended, and recent results in set theory without the axiom of choice and about cardinal characteristics have been added. The third part explains the sophisticated technique of forcing from scratch, now including more details about iterated forcing. The technique is then used to show that certain statements are neither provable nor disprovable from the axioms of set theory. In particular, it is shown that both Martin's Axiom and Suslin's Hypothesis are independent of the axioms of set theory. The final part, with a new chapter on Laver forcing, is mainly concerned with consistency results obtained by iterations of forcing notions such as Cohen forcing, Sacks forcing, and Mathias forcing. The part begins with an extended chapter on countable support iterations of proper forcing notions, now also including proofs of some preservation theorems such as preservation of properness and of certain ultrafilters. In the following chapters, various consistency results concerning possible relations between cardinal characteristics and the existence of Ramsey ultrafilters are presented. For example, a detailed proof of Shelah's astonishing construction of a model with finitely many Ramsey ultrafilters is given. 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, historical remarks, and related results at the end of the chapters, this book is also suitable for self-study.

ISBN: 9783031917523

Standard No.: 10.1007/978-3-031-91752-3doiSubjects--Topical Terms:

1566725
Combinatorial set theory.

LC Class. No.: QA248 / .H35 2025

Dewey Class. No.: 511.322

Combinatorial set theory = with a gentle introduction to forcing /
LDR:04314nmm a2200373 a 4500 001 2410445
003 DE-He213
005 20250527130235.0
006 m d
007 cr nn 008maaau
008 260204s2025 sz s 0 eng d
020 $a 9783031917523 $q (electronic bk.)
020 $a 9783031917516 $q (paper)
024 7 $a 10.1007/978-3-031-91752-3 $2 doi
035 $a 978-3-031-91752-3
040 $a GP $c GP
041 0 $a eng
050 4 $a QA248 $b .H35 2025
072 7 $a PBCD $2 bicssc
072 7 $a PBC $2 bicssc
072 7 $a MAT018000 $2 bisacsh
072 7 $a PBCD $2 thema
072 7 $a PBC $2 thema
082 0 4 $a 511.322 $2 23
090 $a QA248 $b .H157 2025
100 1 $a Halbeisen, Lorenz J. $3 3270884
245 1 0 $a Combinatorial set theory $h [electronic resource] : $b with a gentle introduction to forcing / $c by Lorenz J. Halbeisen.
250 $a Third edition.
260 $a Cham : $b Springer Nature Switzerland : $b Imprint: Springer, $c 2025.
300 $a xvii, 616 p. : $b ill., digital ; $c 24 cm.
490 1 $a Springer monographs in mathematics, $x 2196-9922
505 0 $a Part I: Preliminary -- 1 The Setting -- 2 First-Order Logic in a Nutshell -- 3 Axioms of Set Theory -- Part II: Topics in Combinatorial Set Theory -- 4 Overture: Ramsey's Theorem -- 5 Cardinal Relations in ZF Only -- 6 Forms of Choice -- 7 How to Make Two Balls from One -- 8 Models of Set Theory with Atoms -- 9 Thirteen Cardinals and Their Relations -- 10 The Shattering Number Revisited -- 11 Happy Families and Their Relatives -- 12 Coda: A Dual Form of Ramsey's Theorem -- Part III: From Martin's Axiom to Cohen's Forcing -- 13 The Idea of Forcing -- 14 Martin's Axiom -- 15 The Notion of Forcing -- 16 Proving Unprovability -- 17 Models in Which AC Fails -- 18 Combining Forcing Notions -- 19 Models in Which p=c -- 20 Suslin's Problem -- Part IV: Combinatorics of Forcing Extensions -- 21 Properties of Forcing Extensions -- 22 Cohen Forcing Revisited -- 23 Sacks Forcing -- 24 Silver-Like Forcing Notions -- 25 Miller Forcing -- 26 Mathias Forcing -- 27 Laver Forcing -- 28 How Many Ramsey Ultrafilters Exist? -- 29 Suite.
520 $a This book, now in a revised and extended third edition, provides a comprehensive and accessible introduction to modern axiomatic set theory. After an overview of basic notions in combinatorics and first-order logic, and discussing in great detail the axioms of set theory, the author outlines in the second part the main topics of classical set theory, including Ramsey theory and the axiom of choice. As an application of the axiom of choice, a complete proof of Robinson's construction for doubling a ball by dividing it into only five parts is given. For the new edition, the chapter on permutation models has been extended, and recent results in set theory without the axiom of choice and about cardinal characteristics have been added. The third part explains the sophisticated technique of forcing from scratch, now including more details about iterated forcing. The technique is then used to show that certain statements are neither provable nor disprovable from the axioms of set theory. In particular, it is shown that both Martin's Axiom and Suslin's Hypothesis are independent of the axioms of set theory. The final part, with a new chapter on Laver forcing, is mainly concerned with consistency results obtained by iterations of forcing notions such as Cohen forcing, Sacks forcing, and Mathias forcing. The part begins with an extended chapter on countable support iterations of proper forcing notions, now also including proofs of some preservation theorems such as preservation of properness and of certain ultrafilters. In the following chapters, various consistency results concerning possible relations between cardinal characteristics and the existence of Ramsey ultrafilters are presented. For example, a detailed proof of Shelah's astonishing construction of a model with finitely many Ramsey ultrafilters is given. 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, historical remarks, and related results at the end of the chapters, this book is also suitable for self-study.
650 0 $a Combinatorial set theory. $3 1566725
650 0 $a Forcing (Model theory) $3 1535002
650 1 4 $a Mathematical Logic and Foundations. $3 892656
650 2 4 $a Set Theory. $3 3596414
650 2 4 $a Discrete Mathematics. $3 1569938
710 2 $a SpringerLink (Online service) $3 836513
773 0 $t Springer Nature eBook
830 0 $a Springer monographs in mathematics. $3 1535313
856 4 0 $u https://doi.org/10.1007/978-3-031-91752-3
950 $a Mathematics and Statistics (SpringerNature-11649)