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