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