Generics for computable Mathias forcing

Author:

Cholak Peter A.,Dzhafarov Damir D.,Hirst Jeffry L.,Slaman Theodore A.

Funder

NSF

NSF Postdoctoral Fellowship

John Templeton Foundation

Publisher

Elsevier BV

Subject

Logic

Reference16 articles.

1. On a conjecture of Dobrinen and Simpson concerning almost everywhere domination;Binns;J. Symbolic Logic,2006

2. On Mathias generic sets;Cholak,2012

3. On the strength of Ramsey's theorem for pairs;Cholak;J. Symbolic Logic,2001

4. Algorithmic Randomness and Complexity. Theory and Applications of Computability;Downey,2010

5. A.R. Day, D.D. Dzhafarov, Limits to joining with generics and randoms, http://dx.doi.org/10.1142/9789814449274_0004.

Cited by 11 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. On the Degrees of Constructively Immune Sets;Lecture Notes in Computer Science;2021

2. Canonical immunity and genericity;Fundamenta Mathematicae;2021

3. Thin set theorems and cone avoidance;Transactions of the American Mathematical Society;2020-01-07

4. Pigeons do not jump high;Advances in Mathematics;2019-08

5. Coloring trees in reverse mathematics;Advances in Mathematics;2017-10

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3