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