Automorphisms in the PTIME-Turing degrees of recursive sets

DOI10.1016/S0168-0072(95)00065-8zbMath0865.03034MaRDI QIDQ676317

Theodore A. Slaman, Christine Ann Haught

Publication date: 12 June 1997

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

zbMATH Keywords

forcingautomorphismsrecursive setsoraclepolynomial Turing degrees

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Applications of computability and recursion theory (03D80) Other degrees and reducibilities in computability and recursion theory (03D30)

Related Items (2)

PERMUTATIONS OF THE INTEGERS INDUCE ONLY THE TRIVIAL AUTOMORPHISM OF THE TURING DEGREES ⋮ Permutations of the Integers Induce only the Trivial Automorphism of the Turing Degrees

Cites Work

• On the theory of the PTIME degrees of the recursive sets
• Inhomogeneities in the polynomial-time degrees: The degrees of super sparse sets
• On the Structure of Polynomial Time Reducibility
• Unnamed Item
• Unnamed Item

This page was built for publication: Automorphisms in the PTIME-Turing degrees of recursive sets