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