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