Combinatorial Set Theory: Partition Relations for CardinalsThis work presents the most important combinatorial ideas in partition calculus and discusses ordinary partition relations for cardinals without the assumption of the generalized continuum hypothesis. A separate section of the book describes the main partition symbols scattered in the literature. A chapter on the applications of the combinatorial methods in partition calculus includes a section on topology with Arhangel'skii's famous result that a first countable compact Hausdorff space has cardinality, at most continuum. Several sections on set mappings are included as well as an account of recent inequalities for cardinal powers that were obtained in the wake of Silver's breakthrough result saying that the continuum hypothesis can not first fail at a singular cardinal of uncountable cofinality. |
Table des matières
| 9 | |
| 34 | |
Chapter III Fundamentals about partition relations | 52 |
Chapter IV Trees and positive ordinary partition relations | 80 |
Chapter V Negative ordinary partition relations and the discussion of the finite case | 105 |
Chapter VI The canonization lemmas | 158 |
Chapter VII Large cardinals | 168 |
Chapter VIII Discussion of the ordinary partition relation with superscript 2 | 215 |
Chapter IX Discussion of the ordinary partition relation with superscript G 3 | 233 |
Chapter X Some applications of combinatorial metbods | 263 |
Chapter XI A brief survey of the square bracket relation | 313 |
Bibliography | 335 |
| 341 | |
| 343 | |
Autres éditions - Tout afficher
Combinatorial Set Theory: Partition Relations for Cardinals P. Erdös,A. Máté,A. Hajnal,P. Rado Aucun aperçu disponible - 1984 |
Expressions et termes fréquents
according arbitrary assertion assumption Axiom of Choice claim cofinal coloring f Combinatorial completes the proof contradicts Corollary definition denotes easy elements equivalence classes Erdős established fact finite follows formula free with respect function ƒ given Hajnal Hausdorff space Hence homogeneous set implies inaccessible cardinal increasing sequence induction inequality infinite cardinal integer K-complete K₁ let f limit cardinal Math measurable cardinal N₁ Note obtain order type ordered set ordinal ordinary partition relation partial order partition symbol partition tree preceding lemma prime ideal proof is complete prove Ramsey's theorem regressive function regular cardinal replacing respect to f result right-hand side satisfied set mapping set of cardinality set of color set theory stationary set Stepping-up Lemma subset successor successor cardinal transfinite recursion uncountable verifies wellordering write X₁