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