SPECIALISING TREES WITH SMALL APPROXIMATIONS I
From MaRDI portal
Publication:6103457
DOI10.1017/jsl.2022.24arXiv2101.01594OpenAlexW4220938928WikidataQ114117982 ScholiaQ114117982MaRDI QIDQ6103457
Publication date: 5 June 2023
Published in: The Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2101.01594
Consistency and independence results (03E35) Other combinatorial set theory (03E05) Generic absoluteness and forcing axioms (03E57)
Cites Work
- Unnamed Item
- Guessing models and generalized Laver diamond
- The combinatorial essence of supercompactness
- On the consistency strength of the proper forcing axiom
- Adding closed unbounded subsets of \(\omega_2\) with finite forcing
- On the Hamkins approximation property
- Generalized Martin's axiom and Souslin's hypothesis for higher cardinals
- A weak generalization of MA to higher cardinals
- Two applications of finite side conditions at \(\omega _2\)
- Forcing with sequences of models of two types
- QUOTIENTS OF STRONGLY PROPER FORCINGS AND GUESSING MODELS
- REDUCED POWERS OF SOUSLIN TREES
- Weakly Compact Cardinals and Nonspecial Aronszajn Trees
- Reduced powers of $ℵ_2$-trees
- Special Square Sequences
- The ℵ 2 \1-Souslin Hypothesis
- Souslin trees which are hard to specialise
- SQUARES, ASCENT PATHS, AND CHAIN CONDITIONS
- Specializing trees and answer to a question of Williams
- The special Aronszajn tree property
- Proper forcing remastered
- Ascending paths and forcings that specialize higher Aronszajn trees
- SQUARES AND NARROW SYSTEMS
- Embedding Trees in the Rationals
- Gap forcing
This page was built for publication: SPECIALISING TREES WITH SMALL APPROXIMATIONS I
