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