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