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