Introduction to Set Theory |
Contents
Preface vii | 1 |
༤ Elementary set theory | 12 |
The axioms | 13 |
Copyright | |
28 other sections not shown
Common terms and phrases
assume assumption axiom of choice Cantor normal form choose completes the proof continuum hypothesis contradiction Corollary defined Definition desired disjoint Dmn F Dmn G Dmn h e-transitive easily checked equipotent equivalence relation example exist F maps finite function f function with domain Hence implies infinite cardinal isomorphic least element lemma Let F Let g limit ordinal logic mathematics natural numbers nonempty notion one-one function mapping one-one mapping ordinal arithmetic partial ordering Pier Proof Let proper class properties recursion principle regular cardinal relational axiom Rng F sentence set theory simple ordering strictly increasing subset successor ordinal Suppose symbol Theorem tion transfinite induction Ua<n Uiel UjeJ Vx(x e well-founded relation well-ordering x e Dmn x,y e y-number Zorn's lemma μγ