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