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