A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Automorphisms in the PTIME-Turing degrees of recursive sets
1997
Annals of Pure and Applied Logic
We consider questions related to the rigidity of the structure W, the PTZME-Turing degrees of recursive sets of strings together with PTME-Turing reducibility, <pr , and related structures; do these structures have nontrivial automorphisms? We prove that there is a nontrivial automorphism of an ideal of 3. This can be rephrased in terms of partial relativizations. We consider the sets which are PTZME-Turing computable from a set A, and call this class PTIMEA. Our result can be stated as
doi:10.1016/s0168-0072(95)00065-8
fatcat:63si4h43srcwrnqtp56dju5hum