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