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