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