The finite intersection principle and genericity

Diamondstone David,Downey Rod,Greenberg Noam,Turetsky Dan

MATHEMATICAL PROCEEDINGS OF THE CAMBRIDGE PHILOSOPHICAL SOCIETY（2016）

引用 4|浏览6

暂无评分

摘要

We show that a Delta(0)(2) Turing degree computes solutions to all computable instances of the finite intersection principle if and only if it computes a 1-generic degree. We also investigate finite and infinite variants of the principle.

查看译文

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要