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