The finite intersection principle and genericity

DOI10.1017/S0305004115000651MaRDI QIDQ5360372zbMATH OpenFDO

Authors Noam Greenberg, Dan Turetsky, David Diamondstone, Rodney G. Downey

Publication date 28 September 2017

Published in Mathematical Proceedings of the Cambridge Philosophical Society (Search for Journal in Brave)

zbMATH Keywords

1-generic setcomputabilityTuring degreegeneric setfinite intersection2IP degreeFIP degree

Mathematics Subject Classification ID

Foundations of classical theories (including reverse mathematics) (03B30) Other Turing degree structures (03D28)

Recommendations

• On the strength of the finite intersection principle
• Any FIP real computes a 1-generic
• Generic degrees are complemented
• Lowness for genericity
• A minimal pair in the generic degrees

Cites work

• scientific article; zbMATH DE number 3782930 (Why is no real title available?)
• scientific article; zbMATH DE number 3210031 (Why is no real title available?)
• A characterization of the entropies of multidimensional shifts of finite type
• Countable algebra and set existence axioms
• Embedding and coding below a 1-generic degree
• On the strength of the finite intersection principle
• The atomic model theorem and type omitting
• The canonical Ramsey theorem and computability theory
• Weak comparability of well orderings and reverse mathematics

Cited in

(4)

• Any FIP real computes a 1-generic
• The genericity conjecture
• Dominating the Erdős-Moser theorem in reverse mathematics
• Degrees bounding principles and universal instances in reverse mathematics

This page was built for publication: The finite intersection principle and genericity

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