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