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