SPECIALISING TREES WITH SMALL APPROXIMATIONS I
From MaRDI portal
Abstract: Assuming , we shall use internally club -guessing models as side conditions to show that for every tree of height without cofinal branches, there is a proper and -preserving forcing notion with finite conditions which specialises . Moreover, the forcing has the -approximation property.
Cites work
- A weak generalization of MA to higher cardinals
- Adding closed unbounded subsets of _2 with finite forcing
- Ascending paths and forcings that specialize higher Aronszajn trees
- Embedding Trees in the Rationals
- Forcing with sequences of models of two types
- Gap forcing
- Generalized Martin's axiom and Souslin's hypothesis for higher cardinals
- Guessing models and generalized Laver diamond
- scientific article; zbMATH DE number 3829896 (Why is no real title available?)
- On the consistency strength of the proper forcing axiom
- On the Hamkins approximation property
- Proper forcing remastered
- Quotients of strongly proper forcings and guessing models
- Reduced powers of ℵ_2-trees
- REDUCED POWERS OF SOUSLIN TREES
- Souslin trees which are hard to specialise
- Special Square Sequences
- Specializing trees and answer to a question of Williams
- Squares and narrow systems
- SQUARES, ASCENT PATHS, AND CHAIN CONDITIONS
- The combinatorial essence of supercompactness
- The special Aronszajn tree property
- The ℵ 2 \1-Souslin Hypothesis
- Two applications of finite side conditions at \(\omega _2\)
- Weakly Compact Cardinals and Nonspecial Aronszajn Trees
This page was built for publication: SPECIALISING TREES WITH SMALL APPROXIMATIONS I
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6103457)