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