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