On the strength of the finite intersection principle

DOI10.1007/S11856-012-0150-9zbMATH Open1302.03035arXiv1109.3374OpenAlexW3099017129WikidataQ57951143 ScholiaQ57951143MaRDI QIDQ375889FDOQ375889

Carl Mummert, Damir D. Dzhafarov

Publication date: 1 November 2013

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

Abstract: We study the logical content of several maximality principles related to the finite intersection principle ($FIP$) in set theory. Classically, these are all equivalent to the axiom of choice, but in the context of reverse mathematics their strengths vary: some are equivalent to $ACA$ over $RCA$, while others are strictly weaker, and incomparable with $WKL$. We show that there is a computable instance of $FIP$ all of whose solutions have hyperimmune degree, and that every computable instance has a solution in every nonzero c.e. degree. In terms of other weak principles previously studied in the literature, the former result translates to $FIP$ implying the omitting partial types principle ($mathsfOPT$). We also show that, modulo $Sigm{a}_2^0$ induction, $FIP$ lies strictly below the atomic model theorem ($mathsfAMT$).

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

Recommendations

• Set existence principles and closure conditions: unravelling the standard view of reverse mathematics
• scientific article; zbMATH DE number 3924748
• \(\mathsf{WKL}_0\) and induction principles in model theory
• The axiom of choice in computability theory and reverse mathematics with a cameo for the continuum hypothesis
• Reverse Mathematics of Separation Theorems in Lattice Theory
• On Martin's axiom and forms of choice
• More reverse mathematics of the Heine-Borel theorem
• scientific article; zbMATH DE number 2019844
• Refining the taming of the reverse mathematics zoo
• A decomposition of Brouwer's fan theorem

zbMATH Keywords

axiom of choicereverse mathematicsintersection principles

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (9)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q375889)