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