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