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