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