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