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