東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Combinatorial set theory = with a ge...

Halbeisen, Lorenz J.

FindBook

Google Book

Amazon

博客來

Combinatorial set theory = with a gentle introduction to forcing /

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Combinatorial set theory/ by Lorenz J. Halbeisen.
其他題名:	with a gentle introduction to forcing /
作者:	Halbeisen, Lorenz J.
出版者:	Cham :Springer International Publishing : : 2017.,
面頁冊數:	xvi, 594 p. :ill., digital ;24 cm.
內容註:	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.
Contained By:	Springer eBooks
標題:	Combinatorial set theory. -
電子資源:	http://dx.doi.org/10.1007/978-3-319-60231-8
ISBN:	9783319602318

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. - 2nd ed. - Cham :Springer International Publishing :2017. - xvi, 594 p. :ill., digital ;24 cm. - Springer monographs in mathematics,1439-7382. - Springer monographs in mathematics..

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.

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.

ISBN: 9783319602318

Standard No.: 10.1007/978-3-319-60231-8doiSubjects--Topical Terms:

1566725
Combinatorial set theory.

LC Class. No.: QA248 / .H35 2017

Dewey Class. No.: 511.322

Combinatorial set theory = with a gentle introduction to forcing /
LDR:03112nmm a2200349 a 4500 001 2112834
003 DE-He213
005 20171221000950.0
006 m d
007 cr nn 008maaau
008 180719s2017 gw s 0 eng d
020 $a 9783319602318 $q (electronic bk.)
020 $a 9783319602301 $q (paper)
024 7 $a 10.1007/978-3-319-60231-8 $2 doi
035 $a 978-3-319-60231-8
040 $a GP $c GP
041 0 $a eng
050 4 $a QA248 $b .H35 2017
072 7 $a PBC $2 bicssc
072 7 $a PBCD $2 bicssc
072 7 $a MAT018000 $2 bisacsh
082 0 4 $a 511.322 $2 23
090 $a QA248 $b .H157 2017
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 2nd ed.
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2017.
300 $a xvi, 594 p. : $b ill., digital ; $c 24 cm.
490 1 $a Springer monographs in mathematics, $x 1439-7382
505 0 $a 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.
520 $a 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.
650 0 $a Combinatorial set theory. $3 1566725
650 0 $a Forcing (Model theory) $3 1535002
650 1 4 $a Mathematics. $3 515831
650 2 4 $a Mathematical Logic and Foundations. $3 892656
650 2 4 $a Combinatorics. $3 895617
710 2 $a SpringerLink (Online service) $3 836513
773 0 $t Springer eBooks
830 0 $a Springer monographs in mathematics. $3 1535313
856 4 0 $u http://dx.doi.org/10.1007/978-3-319-60231-8
950 $a Mathematics and Statistics (Springer-11649)