On the strength of the finite intersection principle
- 108 Downloads
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 ACA0 over RCA0, while others are strictly weaker and incomparable with WKL0. We show that there is a computable instance of FIP every solution of which has hyperimmune degree, and that every computable instance has a solution in every nonzero c.e. degree. In particular, FIP implies the omitting partial types principle (OPT) over RCA0. We also show that, modulo Σ 2 0 induction, FIP lies strictly below the atomic model theorem (AMT).
KeywordsIntersection Property Initial Segment Force Notion Intersection Principle Logical Content
Unable to display preview. Download preview PDF.
- J. L. Hirst, A survey of the reverse mathematics of ordinal arithmetic, in Reverse Mathematics 2001, Lecture Notes in Logic, Vol. 21, Association for Symbolic Logic, La Jolla, CA, 2005, pp. 222–234.Google Scholar
- H. Rubin and J. E. Rubin, Equivalents of the Axiom of Choice, Studies in Logic and the Foundations of Mathematics, North-Holland Publishing Co., Amsterdam, 1970.Google Scholar
- H. Rubin and J. E. Rubin, Equivalents of the Axiom of Choice. II, Studies in Logic and the Foundations of Mathematics, Vol. 116, North-Holland Publishing Co., Amsterdam, 1985.Google Scholar
- R. I. Soare, Recursively Enumerable Sets and Degrees, Perspectives in Mathematical Logic, Springer-Verlag, Berlin, 1987.Google Scholar