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