Book:Gaisi Takeuti/Introduction to Axiomatic Set Theory

Subject Matter

 * Set Theory
 * Inner Model Theory

Contents

 * Preface


 * $\S 1$. Introduction
 * $\S 2$. Language and Logic
 * $\S 2$. Definition:Language of Set Theory
 * $\S 3$. Equality
 * $3.1$. Definition:Set Equality
 * $3.2$. Equality is Reflexive and Equality is Symmetric and Equality is Transitive
 * $3.3$. Substitution of Elements
 * $3.4$. Substitutivity of Equality
 * $\S 4$. Classes
 * $4.1$-$4.4$. Definition:Class
 * $4.5$. Definition:Class Equality
 * $4.6$. Definition:Class Membership
 * $4.7$. Class Equality is Reflexive and Class Equality is Symmetric and Class Equality is Transitive
 * $4.8$. Substitutivity of Class Equality
 * $4.9$. Class Equal to All its Elements
 * $4.10$. Definition:Small Class and Definition:Proper Class
 * $4.11$. Set is Small Class
 * $4.12$. Class Member of Class Builder
 * $4.13$. Definition:Russell Class
 * $4.14$. Russell's Paradox
 * $4.15$. Definition:Definable
 * $\S 5$. The Elementary Properties of Classes
 * $5.1$. Definition:Singleton and Definition:Doubleton
 * $5.2$. Definition:Ordered Pair
 * $5.3$. Definition:Unordered Tuple
 * $5.4$. Definition:Ordered Tuple
 * $5.5$. Definition:Set Union/General Definition
 * $5.6$. Definition:Union and Definition:Intersection
 * $5.7$. Union of Doubleton
 * $5.8$. Union is a Set
 * $5.9$. Definition:Subset and Definition:Proper Subset
 * $5.10$. Definition:Power Set
 * $5.11$. Axiom:Axiom of Subsets
 * $5.12$. Axiom of Subsets Equivalents
 * $5.13$. Axiom of Subsets Equivalents
 * $5.14$. Definition:Set Difference
 * $5.15$. Set Difference is Set
 * $5.16$. Definition:Empty Set
 * $5.17$. Set Difference with Self is Empty Set
 * $5.18$. Empty Set Exists
 * $5.19$. Definition:Nonempty Set
 * $5.20$. No Membership Loops
 * $5.21$. No Membership Loops
 * $5.22$. Definition:Universal Class
 * $5.23$. Universal Class is Proper
 * $5.24$. Epsilon Induction
 * $\S 6$. Functions and Relations
 * $6.23$. Foundational Relation has no Relational Loops
 * $6.26$. Well-Founded Relation Determines Minimal Elements/Special Case
 * $6.27$. Well-Founded Induction/Special Case
 * $\S 7$. Ordinal Numbers
 * $7.1$. Definition:Transitive Class
 * $7.2$. Element of Transitive Class
 * $7.3$. Alternate Definition of an Ordinal
 * $7.4$. Alternate Definition of an Ordinal
 * $7.5$. Subset of Ordinals has Minimal Element
 * $7.6$. Initial Segment of Ordinal is Ordinal
 * $7.7$. Ordinal Proper Subset Membership
 * $7.8$. Ordinal Proper Subset Membership
 * $7.9$. Intersection of Two Ordinals is Ordinal
 * $7.10$. Ordinal Membership Trichotomy
 * $7.11$. Definition:Ordinal Class
 * $7.12$. Ordinal Class is Ordinal
 * $7.13$. Burali-Forti Paradox
 * $7.14$. Ordinal Member of Ordinal Class
 * $7.15$. Ordinal Subset of Ordinal Class
 * $7.17$. Transfinite Induction
 * $7.19$. Union of Subset of Ordinals is Ordinal
 * $7.20$. Union of Ordinals is Least Upper Bound
 * $7.21$. Union of Ordinals is Least Upper Bound
 * $7.22$. Definition:Successor Set
 * $7.23$. Ordinal Less than Successor
 * $7.24$. Successor Set of Ordinal is Ordinal
 * $7.25$. No Ordinal Between Set and Successor
 * $7.26$. No Largest Ordinal
 * $7.27$. Definition:Limit Ordinal
 * $7.28$. Definition:Minimal Infinite Successor Set
 * $7.30$. Minimal Infinite Successor Set Fulfils Peano Axioms
 * $7.31$. Principle of Finite Induction/Minimal Infinite Successor Set‎
 * $7.32$. Minimal Infinite Successor Set is Ordinal
 * $7.33$. Minimal Infinite Successor Set is Limit Ordinal
 * $7.34$. No Infinitely Descending Membership Chains
 * $7.35$. Definition:Set Intersection/General Definition
 * $7.38$. Isomorphic Ordinals are Equal
 * $7.39$. Ordinals Isomorphic to the Same Well-Ordered Set
 * $7.40$. Transfinite Recursion/Theorem 1
 * $7.41$. Transfinite Recursion/Corollary
 * $7.42$. Transfinite Recursion/Theorem 2
 * $7.43$. Principle of Recursive Definition/Minimal Infinite Successor Set
 * $7.44$. Definition:Ordinal Function
 * $7.45$. Well-Ordered Transitive Subset Equal or Equal to Initial Segment
 * $7.46$. Condition for Injective Mapping on Ordinals
 * $7.47$. Maximal Injective Mapping from Ordinals to a Set
 * $7.48$. Order Isomorphism between Ordinals and Proper Class/Lemma
 * $7.49$. Order Isomorphism between Ordinals and Proper Class/Theorem
 * $7.50$. Order Isomorphism between Ordinals and Proper Class/Corollary
 * $7.51$. Strict Well-Ordering Isomorphic to a Unique Ordinal Under Unique Function
 * $7.52$. Unique Isomorphism between Ordinal Subset and Unique Ordinal
 * $7.53$. Definition:Lexicographic Order
 * $7.54$. Lexicographic Order Forms Well-Ordering on Ordered Pairs of Ordinals and Lexicographic Order Initial Segments
 * $7.55$. Definition:Canonical Order
 * $7.56$. Canonical Order Well-Orders Ordered Pairs of Ordinals and Canonical Order Initial Segments
 * $7.57$. Definition:Canonical Order
 * $\S 8$. Ordinal Arithmetic
 * $8.1$. Definition:Ordinal Addition
 * $8.2$. Ordinal Addition is Closed
 * $8.3$. Ordinal Addition by Zero
 * $8.4$. Membership Left Compatible with Ordinal Addition
 * $8.5$. Ordinal Addition is Left Cancellable
 * $8.6$. Supremum Inequality for Ordinals
 * $8.7$. Subset Right Compatible with Ordinal Addition
 * $8.8$. Ordinal Subtraction when Possible is Unique
 * $8.9$. Natural Number Addition is Closed
 * $8.10$. Natural Number Plus Ordinal
 * $8.11$. Limit Ordinals Preserved Under Ordinal Addition
 * $8.12$. Ordinal Addition is Associative
 * $8.13$. Unique Limit Ordinal Plus Unique Natural Number
 * $8.14$. Definition:Ordinal Subtraction
 * $8.15$. Definition:Ordinal Multiplication
 * $8.16$. Ordinal Multiplication is Closed
 * $8.17$. Natural Number Multiplication is Closed
 * $8.18$. Ordinal Multiplication by Zero and Ordinal Multiplication by One
 * $8.19$. Membership Left Compatible with Ordinal Multiplication
 * $8.20$. Ordinal Multiplication is Left Cancellable
 * $8.21$. Subset Right Compatible with Ordinal Multiplication
 * $8.22$. Ordinals have No Zero Divisors
 * $8.23$. Limit Ordinals Preserved Under Ordinal Multiplication
 * $8.24$. Ordinal Less than Ordinal Times Limit
 * $8.25$. Ordinal Multiplication is Left Distributive
 * $8.26$. Ordinal Multiplication is Associative
 * $8.27$. Division Theorem for Ordinals
 * $8.28$. Division Theorem
 * $8.29$. Natural Number Times Ordinal
 * $8.30$. Definition:Ordinal Exponentiation
 * $8.31$. Exponent Base of Zero or One
 * $8.32$. Exponent Greater Than or Equal To One
 * $8.33$. Membership Left Compatible with Ordinal Exponentiation
 * $8.34$. Membership Left Cancellable with Ordinal Exponentiation
 * $8.35$. Subset Right Compatible with Ordinal Exponentiation
 * $8.36$. Condition for Membership Right Compatible with Ordinal Exponentiation
 * $8.37$. Lower Bound for Ordinal Exponentiation
 * $8.38$. Unique Ordinal Exponentiation Inequality
 * $8.39$. Limit Ordinals Preserved Under Ordinal Exponentiation
 * $8.40$. Ordinal Less Than Ordinal to Limit Power
 * $8.41$. Ordinal Sum of Powers
 * $8.42$. Ordinal Power of Power
 * $8.43$. Upper Bound for Cantor Normal Form
 * $8.44$. Cantor Normal Form is Unique Representation and Definition:Cantor Normal Form
 * $8.45$. Ordinal Multiplication Algorithm
 * $8.46$. Ordinal Multiplication Algorithm with Limit Bases
 * $8.47$. Ordinal Exponentiation of Terms
 * $8.48$. Ordinal Exponentiation Algorithm
 * $8.49$. Ordinal Exponentiation Algorithm with Limit Exponents
 * $8.50$. Ordinal Exponentiation Algorithm with Limit Exponents/Corollary
 * $\S 9$. Relational Closure and the Rank Functions
 * $9.1$. Transitive Closure Always Exists (Set Theory)
 * $9.2$. Definition:Transitive Closure (Set Theory)
 * $9.7$. Well-Founded Recursion
 * $9.8$. Definition:Supertransitive
 * $9.9$. Definition:Von Neumann Hierarchy
 * $9.10$. Von Neumann Hierarchy is Supertransitive and Von Neumann Hierarchy Comparison
 * $9.13$. Every Set in Von Neumann Universe
 * $9.14$. Definition:Rank (Set Theory)
 * $9.15$. Rank is Ordinal and Ordinal Equal to Rank and Ordinal Subset of Rank
 * $9.16$. Membership Rank Inequality
 * $9.17$. Rank of Set Determined by Members
 * $9.18$. Rank of Ordinal
 * $9.19$. Bounded Rank Implies Sethood
 * $9.20$. Axiom of Regularity (Strong Form)
 * $9.21$. Well-Founded Relation Determines Minimal Elements
 * $9.22$. Well-Founded Induction
 * $\S 10$. Cardinal Numbers
 * $10.1$. Definition:Set Equivalence
 * $10.2$. Set Equivalence is Equivalence Relation
 * $10.3$. Cantor-Bernstein-Schroeder Theorem
 * $10.4$. Cantor's Theorem
 * $10.5$. Cantor's Theorem
 * $\S 11$. The Axiom of Choice, the Greater Continuum Hypothesis, and Cardinal Arithmetic
 * $\S 12$. Models
 * $12.1$. Definition:Structure (Set Theory)
 * $12.2$. Definition:Standard Structure
 * $12.3$. Definition:Standard Structure
 * $12.4$. Definition:Relativisation
 * $12.5$. Relativisation is Standard Model
 * $\S 13$. Absoluteness
 * $\S 14$. The Fundamental Operations
 * $\S 15$. The Gödel Model
 * $\S 16$. The Arithmetization of Model Theory
 * $\S 17$. Cohen's Model
 * $\S 18$. Forcing
 * $\S 19$. Languages, Structures and Models


 * Bibliography


 * Problem List


 * Appendix


 * Index


 * Index of Symbols