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