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