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