The recursively enumerable degrees have infinitely many one-types-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

The recursively enumerable degrees have infinitely many one-types

Published:1989-10 Issue:1-2 Volume:44 Page:1-23
ISSN:0168-0072
Container-title:Annals of Pure and Applied Logic
language:en
Short-container-title:Annals of Pure and Applied Logic

Author:

Ambos-Spies Klaus,Soare Robert I.

Publisher

Elsevier BV

Subject

Logic

Reference8 articles.

1. Computation and Proof Theory;Ambos-Spies,1984

2. Lower bounds for pairs of recursively enumerable degrees;Lachlan;Proc. London Math. Soc.,1966

3. Embedding nondistributive lattices in the recursively enumerable degrees;Lachlan,1972

4. Bounding minimal pairs;Lachlan;J. Symbolic Logic,1979

5. M. Lerman, R.A. Shore and R.I. Soare (1984).

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

1. On the Strongly Bounded Turing Degrees of the Computably Enumerable Sets;Computability and Complexity;2016-12-01

2. Degrees of Unsolvability;Computational Logic;2014

3. Degree Structures: Local and Global Investigations;Bulletin of Symbolic Logic;2006-09

4. On the definable ideal generated by nonbounding c.e. degrees;Journal of Symbolic Logic;2005-03

5. Interpreting N in the computably enumerable weak truth table degrees;Annals of Pure and Applied Logic;2001-01

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP