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