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