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