Archives
Keywords
Commutative projection system Forcing with side conditions countably metacompact projective Boolean algebra free Souslin tree Prevalent singular cardinals Whitehead Problem stationary hitting Generalized Clubs xbox weak square Closed coloring Constructible Universe GMA Microscopic Approach Sierpinski's onto mapping principle positive partition relation S-Space 54G20 square principles ccc Open Access nonmeager set Greatly Mahlo O-space regressive Souslin tree Ascending path Monotonically far weak Kurepa tree indecomposable filter Fast club Lipschitz reduction Generalized descriptive set theory square Vanishing levels polarized partition relation Strongly Luzin set Luzin set Postprocessing function Rock n' Roll Club Guessing AIM forcing Was Ulam right? Singular cardinals combinatorics b-scale C-sequence Forcing Axioms unbounded function ZFC construction Diamond for trees Cohen real Absoluteness Respecting tree P-Ideal Dichotomy Distributive tree Almost countably chromatic Almost-disjoint family middle diamond Chromatic number Hedetniemi's conjecture sap Partition Relations Slim tree L-space Dushnik-Miller Ascent Path Precaliber Jonsson cardinal Antichain Kurepa Hypothesis Parameterized proxy principle diamond star PFA Partition relations for trees Singular cofinality Ulam matrix Hindman's Theorem Almost Souslin Reduced Power Uniformly coherent Sigma-Prikry stationary reflection Local Club Condensation. higher Baire space Coherent tree perfectly normal Hereditarily Lindelöf space Martin's Axiom Intersection model Diamond Countryman line Commutative cancellative semigroups HOD Diamond-sharp Souslin Tree Square-Brackets Partition Relations Small forcing Nonspecial tree Selective Ultrafilter Mandelbrot set club_AD Weakly compact cardinal Entangled linear order coloring number Analytic sets SNR Sakurai's Bell inequality Large Cardinals Prikry-type forcing weak diamond reflection principles Successor of Singular Cardinal Strongly compact cardinal tensor product graph very good scale Knaster and friends specializable Souslin tree Rainbow sets free Boolean algebra Rado's conjecture Successor of Regular Cardinal Foundations stick Uniformly homogeneous PFA(S)[S] Erdos Cardinal Strong coloring Poset OCA incompactness Ineffable cardinal approachability ideal Iterated forcing Subadditive Ramsey theory over partitions Subtle cardinal Fat stationary set strongly bounded groups Axiom R transformations Reflecting stationary set Subnormal ideal Subtle tree property Filter reflection Uniformization Amenable C-sequence Singular Density Interval topology on trees Fodor-type reflection Forcing Non-saturation Erdos-Hajnal graphs Well-behaved magma full tree Dowker space Universal Sequences Ostaszewski square Aronszajn tree super-Souslin tree Knaster Minimal Walks Cardinal Invariants Chang's conjecture Shelah's Strong Hypothesis Cardinal function
Tag Archives: super-Souslin tree
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
