Combinatorial Set Theory With a Gentle Introduction to Forcing /

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

Full beskrivning

Sparad:
Bibliografiska uppgifter
Huvudupphovsman: Halbeisen, Lorenz J. (Författare, medförfattare)
Institutionell upphovsman: SpringerLink (Online service)
Materialtyp: Elektronisk E-bok
Språk:engelska
Publicerad: Cham : Springer Nature Switzerland : Imprint: Springer, 2025.
Upplaga:3rd ed. 2025.
Serie:Springer Monographs in Mathematics,
Ämnen:
Länkar:https://doi.org/10.1007/978-3-031-91752-3
Taggar: Lägg till en tagg
Inga taggar, Lägg till första taggen!

MARC

LEADER 00000nam a22000005i 4500
001 978-3-031-91752-3
003 DE-He213
005 20260810114847.0
007 cr nn 008mamaa
008 250527s2025 sz | o |||| 0|eng d
020 |a 9783031917523  |9 978-3-031-91752-3 
024 7 |a 10.1007/978-3-031-91752-3  |2 doi 
050 4 |a QA8.9-10.3 
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.3  |2 23 
100 1 |a Halbeisen, Lorenz J.  |e author.  |0 (orcid)0000-0001-6078-7237  |1 https://orcid.org/0000-0001-6078-7237  |4 aut  |4 http://id.loc.gov/vocabulary/relators/aut 
245 1 0 |a Combinatorial Set Theory  |h [electronic resource] :  |b With a Gentle Introduction to Forcing /  |c by Lorenz J. Halbeisen. 
250 |a 3rd ed. 2025. 
264 1 |a Cham :  |b Springer Nature Switzerland :  |b Imprint: Springer,  |c 2025. 
300 |a 1 online resource (XVII, 616 p.). 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a text file  |b PDF  |2 rda 
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. 
588 |a Print version record. 
650 0 |a Mathematical logic. 
650 0 |a Set theory. 
650 0 |a Discrete mathematics. 
650 1 4 |a Mathematical Logic and Foundations. 
650 2 4 |a Set Theory. 
650 2 4 |a Discrete Mathematics. 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer Nature eBook 
776 0 8 |i Printed edition:  |z 9783031917516 
776 0 8 |i Printed edition:  |z 9783031917530 
776 0 8 |i Printed edition:  |z 9783031917547 
830 0 |a Springer Monographs in Mathematics,  |x 2196-9922 
856 4 0 |u https://doi.org/10.1007/978-3-031-91752-3 
912 |a ZDB-2-SMA 
912 |a ZDB-2-SXMS 
912 |a ZDB-2-251 
950 |a Mathematics and Statistics (SpringerNature-11649) 
950 |a Mathematics and Statistics (R0) (SpringerNature-43713) 
950 |a Focus Bundle Mathematics and Statistics (SpringerNature-85421)