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