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