KNASTER AND FRIENDS III: SUBADDITIVE COLORINGS
From MaRDI portal
Publication:6095982
DOI10.1017/jsl.2022.50arXiv2106.10730OpenAlexW3176732435MaRDI QIDQ6095982
Assaf Rinot, Chris Lambie-Hanson
Publication date: 11 September 2023
Published in: The Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2106.10730
Aronszajn treeascent pathindexed squarecoherent coloringstationarily layered posetsstrongly unbounded coloringsubadditive coloring
Consistency and independence results (03E35) Other combinatorial set theory (03E05) Chain conditions, complete algebras (06E10) Partition relations (03E02)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fresh subsets of ultrapowers
- Characterizing large cardinals in terms of layered posets
- A family of covering properties
- Reflecting stationary sets and successors of singular cardinals
- The proper forcing axiom and stationary set reflection
- The tree property at successors of singular cardinals
- Local coherence.
- Knaster and friends. I: Closed colorings and precalibers
- Indexed squares
- Canonical structure in the universe of set theory. I
- Was Ulam right? I: basic theory and subnormal ideals
- Walks on ordinals and their characteristics
- Reflection on the coloring and chromatic numbers
- Layered posets and Kunen's universal collapse
- A microscopic approach to Souslin-tree construction. II
- CHAIN CONDITIONS OF PRODUCTS, AND WEAKLY COMPACT CARDINALS
- MRP, tree properties and square principles
- The weak □* is really weaker than the full □
- SQUARES, ASCENT PATHS, AND CHAIN CONDITIONS
- Pseudo-Prikry sequences
- On squares, outside guessing of clubs and I
- A relative of the approachability ideal, diamond and non-saturation
- Knaster and friends II: The C-sequence number
- Aronszajn trees, square principles, and stationary reflection
- Squares and uncountably singularized cardinals
- Ascending paths and forcings that specialize higher Aronszajn trees
- SQUARES AND NARROW SYSTEMS
- Distributive Aronszajn trees
- The fine structure of the constructible hierarchy
- SET MAPPING REFLECTION
