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