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