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