Introduction to Set Theory, Third Edition, Revised and ExpandedCRC Press, 22 jun 1999 - 310 páginas Thoroughly revised, updated, expanded, and reorganized to serve as a primary text for mathematics courses, Introduction to Set Theory, Third Edition covers the basics: relations, functions, orderings, finite, countable, and uncountable sets, and cardinal and ordinal numbers. It also provides five additional self-contained chapters, consolidates the material on real numbers into a single updated chapter affording flexibility in course design, supplies end-of-section problems, with hints, of varying degrees of difficulty, includes new material on normal forms and Goodstein sequences, and adds important recent ideas including filters, ultrafilters, closed unbounded and stationary sets, and partitions. |
Índice
III | 1 |
V | 3 |
VI | 7 |
VII | 17 |
VIII | 18 |
IX | 23 |
X | 29 |
XI | 33 |
XXXIV | 144 |
XXXV | 155 |
XXXVI | 160 |
XXXVII | 164 |
XXXVIII | 171 |
XXXIX | 175 |
XL | 179 |
XLI | 188 |
XII | 39 |
XIII | 42 |
XIV | 46 |
XV | 52 |
XVI | 55 |
XVII | 65 |
XVIII | 69 |
XIX | 74 |
XX | 79 |
XXI | 86 |
XXII | 90 |
XXIII | 93 |
XXIV | 98 |
XXV | 103 |
XXVI | 107 |
XXVII | 111 |
XXVIII | 114 |
XXIX | 119 |
XXX | 124 |
XXXI | 129 |
XXXII | 133 |
XXXIII | 137 |
XLII | 194 |
XLIII | 201 |
XLIV | 205 |
XLV | 208 |
XLVI | 212 |
XLVII | 217 |
XLVIII | 221 |
XLIX | 225 |
L | 230 |
LI | 233 |
LII | 241 |
LIII | 246 |
LIV | 251 |
LV | 256 |
LVI | 260 |
LVII | 267 |
LVIII | 270 |
LIX | 277 |
285 | |
287 | |
Otras ediciones - Ver todo
Introduction to Set Theory, Revised and Expanded Karel Hrbacek,Thomas Jech Vista previa restringida - 2017 |
Términos y frases comunes
a₁ algebra antichain arithmetic assume Axiom of Choice b₁ binary relation bisimulation Chapter choice function closed sets closed unbounded construct Continuum Hypothesis contradiction countable set defined Definition Let denote dense endpoints equipotent equivalence example Exercises 2.1 exists filter finite sequence finite sets follows function f greatest element hence Hint holds implies inaccessible cardinal induction infinite sets intersection isomorphic large cardinals least element Lemma Let f limit ordinal linear linearly ordered set mathematical mutually disjoint natural numbers nonprincipal one-to-one mapping open intervals operation ordered pairs ordinal number partition proof of Theorem prove R₁ rational numbers real numbers Recursion Theorem set of real successor supremum Suslin line Suslin tree system of sets Theorem Let transfinite recursion transitive tree ultrafilter uncountable unique w₁ well-founded set well-ordered set Zermelo-Fraenkel set theory