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