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