SQUARES, ASCENT PATHS, AND CHAIN CONDITIONS
DOI10.1017/JSL.2018.56zbMATH Open1477.03181arXiv1709.04537OpenAlexW2755183470MaRDI QIDQ4647110FDOQ4647110
Authors: Chris Lambie-Hanson, Philipp Lücke
Publication date: 4 January 2019
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1709.04537
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
square principlesKnaster propertylayered posetsproductivity of chain conditionsspecial treeswalks on ordinalsascent paths
Other combinatorial set theory (03E05) Consistency and independence results (03E35) Large cardinals (03E55)
Cites Work
- Set theory. An introduction to independence proofs
- The fine structure of the constructible hierarchy
- Chain conditions of products, and weakly compact cardinals
- Partitioning pairs of countable ordinals
- Squares, scales and stationary reflection
- Weakly Compact Cardinals and Nonspecial Aronszajn Trees
- Iterated forcing and elementary embeddings
- Aronszajn trees and the independence of the transfer property
- Indexed squares
- Squares and covering matrices
- Title not available (Why is that?)
- Partition relations for partially ordered sets
- Saturated ideals
- Reduced powers of $ℵ_2$-trees
- Fresh subsets of ultrapowers
- Layered posets and Kunen's universal collapse
- Characterizing large cardinals in terms of layered posets
- Ascending paths and forcings that specialize higher Aronszajn trees
- Squares and narrow systems
- The ℵ 2 \1-Souslin Hypothesis
- Souslin trees which are hard to specialise
- REDUCED POWERS OF SOUSLIN TREES
- Special Square Sequences
- Conjectures of Rado and Chang and special Aronszajn trees
- Title not available (Why is that?)
- Simultaneous stationary reflection and square sequences
- Aronszajn trees, square principles, and stationary reflection
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
- Aronszajn trees, square principles, and stationary reflection
- A microscopic approach to Souslin-tree construction. II
- 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)