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