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