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