Combinatorial Set Theory: Partition Relations for Cardinals


Book Description

This 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.







Combinatorial Set Theory


Book Description

This 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.




Combinatorial Set Theory


Book Description




Combinatorial Set Theory


Book Description

Combinatorial Set Theory




Finite and Infinite Combinatorics in Sets and Logic


Book Description

This volume contains the accounts of papers delivered at the Nato Advanced Study Institute on Finite and Infinite Combinatorics in Sets and Logic held at the Banff Centre, Alberta, Canada from April 21 to May 4, 1991. As the title suggests the meeting brought together workers interested in the interplay between finite and infinite combinatorics, set theory, graph theory and logic. It used to be that infinite set theory, finite combinatorics and logic could be viewed as quite separate and independent subjects. But more and more those disciplines grow together and become interdependent of each other with ever more problems and results appearing which concern all of those disciplines. I appreciate the financial support which was provided by the N. A. T. O. Advanced Study Institute programme, the Natural Sciences and Engineering Research Council of Canada and the Department of Mathematics and Statistics of the University of Calgary. 11l'te meeting on Finite and Infinite Combinatorics in Sets and Logic followed two other meetings on discrete mathematics held in Banff, the Symposium on Ordered Sets in 1981 and the Symposium on Graphs and Order in 1984. The growing inter-relation between the different areas in discrete mathematics is maybe best illustrated by the fact that many of the participants who were present at the previous meetings also attended this meeting on Finite and Infinite Combinatorics in Sets and Logic.




Set Theory


Book Description

This is a classic introduction to set theory in three parts. The first part gives a general introduction to set theory, suitable for undergraduates; complete proofs are given and no background in logic is required. Exercises are included, and the more difficult ones are supplied with hints. An appendix to the first part gives a more formal foundation to axiomatic set theory, supplementing the intuitive introduction given in the first part. The final part gives an introduction to modern tools of combinatorial set theory. This part contains enough material for a graduate course of one or two semesters. The subjects discussed include stationary sets, delta systems, partition relations, set mappings, measurable and real-valued measurable cardinals. Two sections give an introduction to modern results on exponentiation of singular cardinals, and certain deeper aspects of the topics are developed in advanced problems.




Linear Orderings


Book Description

Linear Orderings




Basic Set Theory


Book Description

Although this book deals with basic set theory (in general, it stops short of areas where model-theoretic methods are used) on a rather advanced level, it does it at an unhurried pace. This enables the author to pay close attention to interesting and important aspects of the topic that might otherwise be skipped over. Written for upper-level undergraduate and graduate students, the book is divided into two parts. The first covers pure set theory, including the basic notions, order and well-foundedness, cardinal numbers, the ordinals, and the axiom of choice and some of its consequences. The second part deals with applications and advanced topics, among them a review of point set topology, the real spaces, Boolean algebras, and infinite combinatorics and large cardinals. A helpful appendix deals with eliminability and conservation theorems, while numerous exercises supply additional information on the subject matter and help students test their grasp of the material. 1979 edition. 20 figures.




Discovering Modern Set Theory. II: Set-Theoretic Tools for Every Mathematician


Book Description

This is the second volume of a two-volume graduate text in set theory. The first volume covered the basics of modern set theory and was addressed primarily to beginning graduate students. The second volume is intended as a bridge between introductory set theory courses such as the first volume and advanced monographs that cover selected branches of set theory. The authors give short but rigorous introductions to set-theoretic concepts and techniques such as trees, partition calculus, cardinal invariants of the continuum, Martin's Axiom, closed unbounded and stationary sets, the Diamond Principle, and the use of elementary submodels. Great care is taken to motivate concepts and theorems presented.