SQUARES, ASCENT PATHS, AND CHAIN CONDITIONS

DOI10.1017/jsl.2018.56zbMath1477.03181arXiv1709.04537OpenAlexW2755183470MaRDI QIDQ4647110

Philipp Lücke, Chris Lambie-Hanson

Publication date: 4 January 2019

Published in: The Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1709.04537

zbMATH Keywords

square principlesKnaster propertylayered posetsproductivity of chain conditionsspecial treeswalks on ordinalsascent paths

Mathematics Subject Classification ID

Consistency and independence results (03E35) Large cardinals (03E55) Other combinatorial set theory (03E05)

Related Items

A microscopic approach to Souslin-tree construction. II, A note on highly connected and well-connected Ramsey theory, KNASTER AND FRIENDS III: SUBADDITIVE COLORINGS, SPECIALISING TREES WITH SMALL APPROXIMATIONS I, Strong tree properties, Kurepa trees, and guessing models, CLOSURE PROPERTIES OF MEASURABLE ULTRAPOWERS, Knaster and friends II: The C-sequence number

Cites Work

• Unnamed Item
• Unnamed Item
• Squares and covering matrices
• Fresh subsets of ultrapowers
• Characterizing large cardinals in terms of layered posets
• Partition relations for partially ordered sets
• Partitioning pairs of countable ordinals
• Set theory. An introduction to independence proofs
• Indexed squares
• Layered posets and Kunen's universal collapse
• SQUARES, SCALES AND STATIONARY REFLECTION
• CHAIN CONDITIONS OF PRODUCTS, AND WEAKLY COMPACT CARDINALS
• Conjectures of Rado and Chang and special Aronszajn trees
• REDUCED POWERS OF SOUSLIN TREES
• Weakly Compact Cardinals and Nonspecial Aronszajn Trees
• Iterated Forcing and Elementary Embeddings
• Reduced powers of $ℵ_2$-trees
• Special Square Sequences
• The ℵ 2 \1-Souslin Hypothesis
• Saturated ideals
• Souslin trees which are hard to specialise
• Simultaneous stationary reflection and square sequences
• Aronszajn trees, square principles, and stationary reflection
• Ascending paths and forcings that specialize higher Aronszajn trees
• SQUARES AND NARROW SYSTEMS
• Aronszajn trees and the independence of the transfer property
• The fine structure of the constructible hierarchy