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