Archives
Keywords
Aronszajn tree Whitehead Problem Intersection model Strong coloring Poset Club Guessing Nonspecial tree Subnormal ideal Interval topology on trees transformations coloring number Fodor-type reflection Rainbow sets sap Precaliber Non-saturation ZFC construction Absoluteness P-Ideal Dichotomy Shelah's Strong Hypothesis Amenable C-sequence Generalized Clubs super-Souslin tree Prevalent singular cardinals Iterated forcing Jonsson cardinal Vanishing levels Forcing Square-Brackets Partition Relations Sierpinski's onto mapping principle Prikry-type forcing Diamond-sharp Luzin set Ascending path Open Access middle diamond Local Club Condensation. full tree SNR Dowker space Hedetniemi's conjecture Monotonically far Partition relations for trees Forcing Axioms Greatly Mahlo Cohen real C-sequence Souslin Tree free Souslin tree Almost countably chromatic Sakurai's Bell inequality Cardinal function Hindman's Theorem Strongly Luzin set tensor product graph Closed coloring Strongly compact cardinal Kurepa Hypothesis weak Kurepa tree Respecting tree Fast club O-space Uniformly homogeneous polarized partition relation xbox Well-behaved magma Axiom R HOD Chang's conjecture Hereditarily Lindelöf space Almost-disjoint family Reduced Power Chromatic number Generalized descriptive set theory Parameterized proxy principle Coherent tree Ostaszewski square perfectly normal Singular cofinality stationary reflection Rock n' Roll positive partition relation Forcing with side conditions stationary hitting Almost Souslin Was Ulam right? Ulam matrix Uniformization projective Boolean algebra ccc Slim tree specializable Souslin tree stick Subadditive Rado's conjecture Minimal Walks AIM forcing Microscopic Approach Partition Relations very good scale higher Baire space Ineffable cardinal club_AD Antichain Subtle tree property Uniformly coherent diamond star free Boolean algebra Distributive tree Foundations countably metacompact Lipschitz reduction Commutative projection system Fat stationary set Successor of Singular Cardinal Subtle cardinal Universal Sequences square principles regressive Souslin tree Singular cardinals combinatorics Martin's Axiom Analytic sets 54G20 Constructible Universe Erdos-Hajnal graphs Singular Density square incompactness Mandelbrot set Commutative cancellative semigroups PFA(S)[S] Dushnik-Miller Reflecting stationary set L-space Knaster and friends nonmeager set GMA indecomposable filter Successor of Regular Cardinal Knaster Small forcing Erdos Cardinal Selective Ultrafilter reflection principles S-Space Large Cardinals Postprocessing function PFA Diamond for trees weak square Ascent Path Ramsey theory over partitions Cardinal Invariants Weakly compact cardinal approachability ideal Sigma-Prikry Filter reflection unbounded function OCA Diamond weak diamond Countryman line Entangled linear order strongly bounded groups b-scale
Tag Archives: super-Souslin tree
More notions of forcing add a square
Joint work with Yair Hayut and Zhixing You. Abstract. Foreman and Magidor showed that the continuum hypothesis implies the existence of a countably-closed $\aleph_2$-cc forcing notion $\mathbb P$ for adding $\square_{\omega_1}$. Here, we show that $\mathbb P$ may consistently be … Continue reading
Posted in Squares and Diamonds
Tagged full tree, Souslin Tree, square principles, super-Souslin tree
Comments Off on More notions of forcing add a square
A forcing axiom deciding the generalized Souslin Hypothesis
Joint work with Chris Lambie-Hanson. Abstract. We derive a forcing axiom from the conjunction of square and diamond, and present a few applications, primary among them being the existence of super-Souslin trees. It follows that for every uncountable cardinal $\lambda$, … Continue reading
Posted in Publications, Souslin Hypothesis
Tagged 03E05, 03E35, 03E57, Diamond, Forcing Axioms, Souslin Tree, square, super-Souslin tree
1 Comment
