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