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