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