Archives
Keywords
Ineffable cardinal Singular Density PFA Cohen real Sakurai's Bell inequality Hereditarily Lindelöf space Vanishing levels Ascent Path Uniformly homogeneous Filter reflection L-space Weakly compact cardinal Was Ulam right Martin's Axiom full tree HOD sap Fat stationary set reflection principles Nonspecial tree Poset Shelah's Strong Hypothesis Local Club Condensation. Almost Souslin Erdos-Hajnal graphs Erdos Cardinal Singular cofinality Large Cardinals Closed coloring Uniformization Ramsey theory over partitions Subtle tree property Small forcing Axiom R ccc Minimal Walks Singular cardinals combinatorics Absoluteness Iterated forcing GMA Analytic sets Club Guessing 54G20 Cardinal Invariants transformations stationary hitting Partition Relations Fast club ZFC construction Hedetniemi's conjecture Hindman's Theorem Sierpinski's onto mapping principle Almost-disjoint family Distributive tree Coherent tree Generalized Clubs Souslin Tree square principles Lipschitz reduction Strong coloring super-Souslin tree polarized partition relation tensor product graph Subtle cardinal strongly bounded groups Commutative cancellative semigroups coloring number Ulam matrix approachability ideal Dowker space Well-behaved magma positive partition relation stick Non-saturation free Boolean algebra SNR weak diamond OCA specializable Souslin tree Prevalent singular cardinals indecomposable ultrafilter Parameterized proxy principle Aronszajn tree Postprocessing function Subnormal ideal Whitehead Problem square Successor of Regular Cardinal P-Ideal Dichotomy Dushnik-Miller unbounded function Forcing Axioms Uniformly coherent Strongly Luzin set free Souslin tree Almost countably chromatic S-Space weak square Kurepa Hypothesis Diamond countably metacompact Foundations AIM forcing diamond star Fodor-type reflection Reduced Power Open Access club_AD Selective Ultrafilter Ostaszewski square weak Kurepa tree Knaster middle diamond Sigma-Prikry Jonsson cardinal Antichain Cardinal function Forcing Chromatic number stationary reflection Prikry-type forcing regressive Souslin tree Mandelbrot set incompactness Universal Sequences Diamond for trees projective Boolean algebra Generalized descriptive set theory Knaster and friends Precaliber Luzin set Microscopic Approach higher Baire space Slim tree Amenable C-sequence b-scale Reflecting stationary set Rado's conjecture xbox PFA(S)[S] Square-Brackets Partition Relations Greatly Mahlo Subadditive Constructible Universe nonmeager set Rock n' Roll very good scale Chang's conjecture Diamond-sharp Rainbow sets Successor of Singular Cardinal O-space C-sequence
Tag Archives: specializable Souslin tree
Proxy principles in combinatorial set theory
Joint work with Ari Meir Brodsky and Shira Yadai. Abstract. The parameterized proxy principles were introduced by Brodsky and Rinot in a 2017 paper as new foundations for the construction of $\kappa$-Souslin trees in a uniform way that does not … Continue reading
Posted in Preprints, Souslin Hypothesis
Tagged C-sequence, free Souslin tree, Parameterized proxy principle, Souslin Tree, specializable Souslin tree, square principles, xbox
Comments Off on Proxy principles in combinatorial set theory
A remark on Schimmerling’s question
Joint work with Ari Meir Brodsky. Abstract. Schimmerling asked whether $\square^*_\lambda$ together with GCH entails the existence of a $\lambda^+$-Souslin tree, for a singular cardinal $\lambda$. Here, we provide an affirmative answer under the additional assumption that there exists a … Continue reading