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