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