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