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