This document provides an overview of set theory including naive set theory, axiomatic set theory using Zermelo-Fraenkel axioms, ordinal and cardinal numbers, independence proofs in set theory, and non-well-founded set theory. It covers topics such as constructible sets, the continuum hypothesis, and independence results. The document is intended as a textbook on pure set theory.
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0 ratings0% found this document useful (0 votes)
1K views205 pages
Devlin - The Joy of Sets
This document provides an overview of set theory including naive set theory, axiomatic set theory using Zermelo-Fraenkel axioms, ordinal and cardinal numbers, independence proofs in set theory, and non-well-founded set theory. It covers topics such as constructible sets, the continuum hypothesis, and independence results. The document is intended as a textbook on pure set theory.
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 205
Contents
Preface V
1 Naive Set Theory 1
1.1 What is a Set? 1 1.2 Operations on Sets 4 1.3 Notation for Sets 6 1.4 Sets of Sets 7 1.5 Relations .... 10 1.6 Functions .... 12 1.7 Well-Orderings and Ordinals 16 1.8 Problems ........... 25
2 The Zermelo-Fraenkel Axioms 29
2.1 The Language of Set Theory 30 2.2 The Cumulative Hierarchy of Sets 35 2.3 The Zermelo-Fraenkel Axioms .. 40 2.4 Classes . . . . . . . . . . . . . . . . 46 2.5 Set Theory as an Axiomatic Theory 50 2.6 The Recursion Principle 51 2.7 The Axiom of Choice . 56 2.8 Problems ........ 63
4.1 The Borel Hierarchy . . . . . . . . . . . . 101 4.2 Closed Unbounded Sets . . . . . . . . . . 103 4.3 Stationary Sets and Regressive Functions 106 4.4 Trees . . . . . . . . . . . . . . . . 109 4.5 Extensions of Lebesgue Measure 113 4.6 A Result About the GCH . . 116
5 The Axiom of Constructibility 120
5.1 Constructible Sets . . . . . . 120 5.2 The Constructible Hierarchy . 123 5.3 The Axiom of Constructibility 124 5.4 The Consistency of V= L . . . 127 5.5 Use of the Axiom of Constructibility 128
6 Independence Proofs in Set Theory 130
6.1 Sorne Undecidable Statements . . . . 130 6.2 The Idea of a Boolean-Valued Universe. 130 6.3 The Boolean-Valued Universe . . . . . . 133 6.4 V 8 and V . . . . . . . . . . . . . . . . . 136 6.5 Boolean-Valued Sets and Independence Proofs 137 6.6 The Nonprovability of the CH . . . . . . . . . . 139
7 Non-Well-Founded Set Theory 143
7.1 Set-Membership Diagrams .. 145 7.2 The Anti-Foundation Axiom .. 151 7.3 The Solution Lemma . . . . . . 156 7.4 Inductive Definitions Under AFA 159 7.5 Graphs and Systems . . . . . 163 7.6 Proof of the Solution Lemma 168 7. 7 Co-Inductive Definitions 169 7.8 A Model of zF- +AFA 173
Rene Cori, Daniel Lascar, Donald H. Pelletier - Mathematical Logic - A Course With Exercises Part II - Recursion Theory, Godel's Theorems, Set Theory, Model Theory (2001, Oxford University Press)