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