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