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