The finite intersection principle and genericity

DOI10.1017/S0305004115000651zbMATH Open1375.03046MaRDI QIDQ5360372FDOQ5360372

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)

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

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)

Cites Work

• A characterization of the entropies of multidimensional shifts of finite type
• Title not available (Why is that?)
• On the strength of the finite intersection principle
• The atomic model theorem and type omitting
• Weak comparability of well orderings and reverse mathematics
• Countable algebra and set existence axioms
• Embedding and coding below a 1-generic degree
• Title not available (Why is that?)
• The canonical Ramsey theorem and computability theory

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)