Notes on singular cardinal combinatorics
This paper, an extended version of the author's 2004 Banff lectures, contains a lovely compendium of combinatorial results on successors of singular cardinals, from various authors. The following are the key words on the theorems which are proved, in most cases completely, in an informal style. GCH implies diamond. Club guessing holds in ZFC. Square implies the existence of Souslin tree. Weak square is equivalent to the existence of a special tree. There is a stationary set with square on it. Properties of Shelah's \(I[\lambda]\). Internally approaching chains. Scales, good points, essential upper bounds. Incompactness of systems of countable sets with transversals. Good scales. Various forms of the square principle are negated by PFA, MM. Shelah's trichotomy theorem, very good scales if SCH fails.
- A compactness theorem for singular cardinals, free algebras, Whitehead problem and transversals
- A new class of order types
- A very weak square principle
- Aronszajn trees and the independence of the transfer property
- Canonical structure in the universe of set theory. I
- Club guessing sequences and filters
- Higher Souslin trees and the generalized continuum hypothesis
- scientific article; zbMATH DE number 3829896 (Why is no real title available?)
- scientific article; zbMATH DE number 3898876 (Why is no real title available?)
- scientific article; zbMATH DE number 3702632 (Why is no real title available?)
- scientific article; zbMATH DE number 3503245 (Why is no real title available?)
- scientific article; zbMATH DE number 734993 (Why is no real title available?)
- Partitioning pairs of countable ordinals
- Some exact equiconsistency results in set theory
- Squares, scales and stationary reflection
- Strong axioms of infinity and elementary embeddings
- The fine structure of the constructible hierarchy
- When Does Almost Free Imply Free? (For Groups, Transversals, etc.)
- On the relationship between mutual and tight stationarity
- Successive failures of approachability
- Forcing axioms and the Galvin number
- Patterns of stationary reflection
- Forcing axioms and the complexity of non-stationary ideals
- The semi-weak square principle
- Successive cardinals with no partial square
- Squares, scales and stationary reflection
- Namba forcing and no good scale
- Successors of singular cardinals
- Diagonal Prikry extensions
- Bounded stationary reflection. II.
- INTERNAL APPROACHABILITY AND REFLECTION
- Approachability at the second successor of a singular cardinal
- Aronszajn trees and the successors of a singular cardinal
- Subcompact cardinals, squares, and stationary reflection
- Separating weak partial square principles
- The eightfold way
- Noetherian type in topological products
- Getting more colors I
- Getting more colors. II
- Embeddings into outer models
- I₀ and combinatorics at ^+
- A new obstruction for normal spanning trees
- CLOSURE PROPERTIES OF MEASURABLE ULTRAPOWERS
- Squares and narrow systems
- TREES AND STATIONARY REFLECTION AT DOUBLE SUCCESSORS OF REGULAR CARDINALS
- Club-guessing, stationary reflection, and coloring theorems
- Games with filters. I
- On compactness of weak square at singulars of uncountable cofinality
- Magidor-like forcing and the cofinality of the Galvin number
- Continuous tree-like scales
- Total failure of approachability at successors of singulars of countable cofinality
- A model of Cummings and Foreman revisited
- On ideals related to \(I[\lambda]\)
- Some problems in singular cardinals combinatorics
- Proceedings of the workshop on singular cardinals combinatorics, Banff, Canada, May 1--6, 2004
This page was built for publication: Notes on singular cardinal combinatorics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q816288)
