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