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