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