The theory of the polynomial many-one degrees of recursive sets is undecidable-Reference-Cited by-同舟云学术

The theory of the polynomial many-one degrees of recursive sets is undecidable

Published:1992 Issue: Volume: Page:209-218
ISSN:0302-9743
Container-title:STACS 92
language:
Short-container-title:

Author:

Ambos-Spies Klaus,Nies André

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-55210-3_185.pdf

Reference17 articles.

1. K. Ambos-Spies, On the structure of polynomial time degrees, in “STACS 84”, Lecture Notes in Computer Science, 166 (1984) 198–208, Springer Verlag.

2. K. Ambos-Spies, On the structure of the polynomial time degrees of recursive sets, Tech. Rep. 206 (1985), Abteilung Informatik, Universität Dortmund.

3. K. Ambos-Spies, An inhomogeneity in the structure of Karp degrees, SIAM Journal on Computing 15 (1986) 958–63.

4. K. Ambos-Spies, Minimal pairs for polynomial time reducibilities, in “Computation Theory and Logic”, Lecture Notes in Computer Science, 270 (1987) 1–13, Springer Verlag.

5. K. Ambos-Spies, A. Nies and R.A. Shore, The theory of the recursively enumerable weak truthtable degrees is undecidable, J. Symbolic Logic, to appear.

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

1. A Uniformity of Degree Structures;complexity, logic, and recursion theory;2019-05-07

2. The universality of polynomial time Turing equivalence;Mathematical Structures in Computer Science;2016-07-13

3. Uniformly hard languages;Theoretical Computer Science;2003-04

4. Effectively dense Boolean algebras and their applications;Transactions of the American Mathematical Society;2000-07-12

5. Exact Pairs for Abstract Bounded Reducibilities;Mathematical Logic Quarterly;1999