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