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