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