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