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