SQUARES, ASCENT PATHS, AND CHAIN CONDITIONS
From MaRDI portal
Publication:4647110
Abstract: With the help of various square principles, we obtain results concerning the consistency strength of several statements about trees containing ascent paths, special trees, and strong chain conditions. Building on a result that shows that Todorv{c}evi'{c}'s principle implies an indexed version of , we show that for all infinite, regular cardinals , the principle implies the existence of a -Aronszajn tree containing a -ascent path. We then provide a complete picture of the consistency strengths of statements relating the interactions of trees with ascent paths and special trees. As a part of this analysis, we construct a model of set theory in which -Aronszajn trees exist and all such trees contain -ascent paths. Finally, we use our techniques to show that the assumption that the -Knaster property is countably productive and the assumption that every -Knaster partial order is -stationarily layered both imply the failure of .
Recommendations
- Rado's conjecture and ascent paths of square sequences
- scientific article; zbMATH DE number 3896952
- A proof of the square paths conjecture
- Squares, clique graphs, and chordality
- Ramsey numbers of squares of paths
- The square of paths and cycles
- Paths in the square unit lattice
- The square of the line graph and path ideals
- Rectangular analogues of the square paths conjecture and the univariate Delta conjecture
Cites work
- scientific article; zbMATH DE number 3821802 (Why is no real title available?)
- scientific article; zbMATH DE number 3805451 (Why is no real title available?)
- Aronszajn trees and the independence of the transfer property
- Aronszajn trees, square principles, and stationary reflection
- Ascending paths and forcings that specialize higher Aronszajn trees
- Chain conditions of products, and weakly compact cardinals
- Characterizing large cardinals in terms of layered posets
- Conjectures of Rado and Chang and special Aronszajn trees
- Fresh subsets of ultrapowers
- Indexed squares
- Iterated forcing and elementary embeddings
- Layered posets and Kunen's universal collapse
- Partition relations for partially ordered sets
- Partitioning pairs of countable ordinals
- REDUCED POWERS OF SOUSLIN TREES
- Reduced powers of $ℵ_2$-trees
- Saturated ideals
- Set theory. An introduction to independence proofs
- Simultaneous stationary reflection and square sequences
- Souslin trees which are hard to specialise
- Special Square Sequences
- Squares and covering matrices
- Squares and narrow systems
- Squares, scales and stationary reflection
- The fine structure of the constructible hierarchy
- The ℵ 2 \1-Souslin Hypothesis
- Weakly Compact Cardinals and Nonspecial Aronszajn Trees
Cited in
(12)- SPECIALISING TREES WITH SMALL APPROXIMATIONS I
- Strong tree properties, Kurepa trees, and guessing models
- A note on highly connected and well-connected Ramsey theory
- KNASTER AND FRIENDS III: SUBADDITIVE COLORINGS
- CLOSURE PROPERTIES OF MEASURABLE ULTRAPOWERS
- Knaster and friends II: The C-sequence number
- Chain conditions of products, and weakly compact cardinals
- Weak square sequences and special Aronszajn trees
- Fresh subsets of ultrapowers
- A microscopic approach to Souslin-tree construction. II
- Aronszajn trees, square principles, and stationary reflection
- Ascending paths and forcings that specialize higher Aronszajn trees
This page was built for publication: SQUARES, ASCENT PATHS, AND CHAIN CONDITIONS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4647110)