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