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