Applications of complexity theory to Σo-definability Problems in arithmetic-Reference-Cited by-同舟云学术

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

Applications of complexity theory to Σo-definability Problems in arithmetic

Published:1980 Issue: Volume: Page:363-369
ISSN:0075-8434
Container-title:Lecture Notes in Mathematics
language:
Short-container-title:

Author:

Wilkie A. J.

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/BFb0090174

Reference6 articles.

1. J.H. Bennett, "On Spectra", Ph.D. dissertation, Princeton University, (1962).

2. K.L. Manders, "Computational Complexity of Decision Problems in Elementary Number Theory", this volume.

3. J. Meloul, "Rudimentary Predicates, Low Complexity Classes and Related Automata", D.Phil. dissertation, Oxford University, (1979).

4. V.A. Nepomnjascii, "Rudimentary Interpretations of Two-Tape Turing Computation", Kebernetika, 6, (1970). Translated in: Cybernetics, December (1972).

5. R. Parikh, "Existence and Feasibility in Arithmetic", J.S.L. 36, (1971).

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

1. A parameterized halting problem, the linear time hierarchy, and the MRDP theorem;Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science;2018-07-09

2. On end extensions of models of subsystems of peano arithmetic;Theoretical Computer Science;2001-04

3. Rudimentary reductions revisited;Information Processing Letters;1991-10

4. Interpretability Logic;Mathematical Logic;1990

5. Bounded Arithmetic Formulas and Turing Machines of Constant Alternation;Studies in Logic and the Foundations of Mathematics;1986

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP