|
|
|
|
![[parent]](http://images.planetmath.org:8080/images/uparrow.png)
index of set theory
|
(Definition)
|
|
"index of set theory" is owned by rspuzio.
|
|
(view preamble)
Cross-references: combinatorial principle, Diamond, clubsuit, equivalent, Levy collapse, proof of complete partial orders do not add small subsets, complete partial orders do not add small subsets, Boolean valued model, proof that forcing notions are equivalent to their composition, proof of partial order with chain condition does not collapse cardinals, partial order with chain condition does not collapse cardinals, iterated forcing and composition, iterated forcing, FS iterated forcing preserves chain condition, forcings are equivalent if one is dense in the other, forcing relation, forcing, equivalence of forcing notions, composition preserves chain condition, composition of forcing notions, chain condition, universe, Tarski's axiom, proof of properties of universe, example of universe of finite sets, example of universe, Zorn's lemma, Zermelo's well-ordering theorem, Zermelo's postulate, Martin's axiom is consistent, Martin's axiom and the continuum hypothesis, Martin's axiom, well-ordering principle implies axiom of choice, well-ordering principle for natural numbers proven from the principle of finite induction, selector, relation as union of functions, proof that a relation is union of functions if and only if AC, proof of Zermelo's well-ordering theorem, proof of Zermelo's postulate, proof of Tukey's lemma, Tukey's lemma, permutation model, maximality principle, Kuratowski's lemma, Hausdorff's maximum principle, equivalence of Zorn's lemma and the axiom of choice, generalized continuum hypothesis, continuum hypothesis, axiom schema of separation, axiom of union, axiom of power set, axiom of pairing, axiom of infinity, axiom of extensionality, axiom of determinacy, axiom of countable choice, axiom of choice, inaccessible cardinals, inductive set, weakly compact cardinals and the tree property, weakly compact cardinal, von Neumann integer, Veblen function, uniqueness of cardinality, uncountable, Suslin tree, example of Aronszajn tree, Aronszajn tree, partitions less than cofinality, law of trichotomy, the Cartesian product of a finite number of countable sets is countable, successor cardinal, successor, thin set, subsets of countable sets are countable, stationary set, Schroeder-Bernstein theorem, proof that the rationals are countable, proof that countable unions are countable, proof of theorems in additively indecomposable, proof of the existence of transcendental numbers, proof of Fodor's lemma, proof of fixed points of normal functions, proof of Cantor's theorem, another proof of pigeonhole principle, proof of pigeonhole principle, pigeonhole principle, ordinal number, ordinal arithmetic, open and closed intervals have the same cardinality, ordinal, normal, natural number, limit cardinal, König's theorem, infinite, Hilbert's hotel, Fodor's lemma, fixed points of normal functions, finite character, finite, countably infinite, countable, club filter, club, classes of ordinals and enumerating functions, cardinality of the rationals, cardinality of the continuum, cardinality of disjoint union of finite sets, cardinality of a countable union, cardinality, cardinal successor, cardinal number, cardinal exponentiation under GCH, cardinal arithmetic, Cantor's theorem, Cantor's diagonal argument, Cantor normal form, beth numbers, another proof of cardinality of the rationals, all algebraic numbers in a sequence, algebraic numbers are countable, aleph numbers, additively indecomposable, well ordered set, filtration, tree property, tree, branch, antichain, chain, another definition of cofinality, cofinality, visualizing maximal elements, minimal element, maximal element, poset, one-to-one function from onto function, choice function, transitive relation, transitive closure, the inverse image commutes with set operations, symmetric relation, symmetric difference, set difference, restriction of a function, relation, reflexive relation, range, quasi-inverse of a function, properties of functions, properties of a function, period of mapping, partial mapping, partial function, operations on relations, operation, bijection, period, mapping, level set, right function notation, left function notation, irreflexive, inverse image, invariant, inclusion mapping, identity map, function graph, function, action, transformation, fix, fibre, domain, direct image, equivalence class, constant function, argument, example of antisymmetric, antisymmetric, de Morgan's laws, principle of finite induction proven from the well-ordering principle for natural numbers, principle of finite induction, an example of mathematical induction, proper subset, symmetric difference operator, associativity, proof, Cartesian product, criterion for a set to be transitive, transitive set, generalized Cartesian product, power set, union, subset, set theory
There is 1 reference to this entry.
This is version 14 of index of set theory, born on 2007-02-06, modified 2007-02-07.
Object id is 8883, canonical name is IndexOfSetTheory.
Accessed 1921 times total.
Classification:
| AMS MSC: | 03E30 (Mathematical logic and foundations :: Set theory :: Axiomatics of classical set theory and its fragments) |
|
|
|
|
|
|
Pending Errata and Addenda
|
|
|
|
|
|
|
|
|
|
|
