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