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