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