On the strength of the finite intersection principle

DOI10.1007/S11856-012-0150-9zbMath1302.03035arXiv1109.3374OpenAlexW3099017129WikidataQ57951143 ScholiaQ57951143MaRDI QIDQ375889

Carl Mummert, Damir D. Dzhafarov

Publication date: 1 November 2013

Published in: Israel Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1109.3374

zbMATH Keywords

reverse mathematicsaxiom of choiceintersection principles

Mathematics Subject Classification ID

Foundations of classical theories (including reverse mathematics) (03B30) Second- and higher-order arithmetic and fragments (03F35) Axiom of choice and related propositions (03E25)

Related Items (9)

Refining the taming of the reverse mathematics zoo ⋮ Inductive inference and reverse mathematics ⋮ On the existence of a connected component of a graph ⋮ Dominating the Erdős-Moser theorem in reverse mathematics ⋮ OPEN QUESTIONS ABOUT RAMSEY-TYPE STATEMENTS IN REVERSE MATHEMATICS ⋮ Any FIP real computes a 1-generic ⋮ The finite intersection principle and genericity ⋮ On the logical strengths of partial solutions to mathematical problems ⋮ Cohesive avoidance and strong reductions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Reverse mathematics and properties of finite character
• Weak comparability of well orderings and reverse mathematics
• Equivalents of the axiom of choice. 2nd ed
• On the strength of Ramsey's theorem for pairs
• Reverse Mathematics: The Playground of Logic
• Open Questions in Reverse Mathematics
• Combinatorial principles weaker than Ramsey's Theorem for pairs
• The atomic model theorem and type omitting
• Bounding prime models
• The axiom of choice

This page was built for publication: On the strength of the finite intersection principle