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