Abstract
We study automorphism groups of two important predicates in computability theory: the predicate χ ∈ Wy and the graph of a universal partially computable function. It is shown that all automorphisms of the predicates in question are computable. The actions of the automorphism groups on some index sets are examined, and we establish a number of results on the structure of these. We also look into homomorphisms of the two predicates. In this case the situation changes: all homomorphisms of the universal function are computable, but in each Turing degree, homomorphisms of χ ∈ Wy exist.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
REFERENCES
H. B. Enderton, “Elements of recursion theory,” in Handbook of Mathematical Logic, J. Barwise (ed.), North-Holland, New York (1977).
P. Odifreddi, Classical Recursion Theory, North Holland, Amsterdam (1989).
M. Blum and I. Marques, “On complexity properties of recursively enumerable sets,” J. Symb. Log., 38, No. 4, 579-593 (1973).
J. Barwise, “Back and forth through infinitary logic,” in Studies in Model Theory, MAA Stud. Math., Vol. 8, M. D. Morley (ed.), Math. Ass. Am., Washington (1973), pp. 5-34.
D. Kueker, “Definability, automorphisms and infinitary languages,” in The Syntax and Semantics of Infinitary Languages, Lect. Notes Math., Vol. 72, Springer, Berlin (1968), pp. 152-165.
J. J. Rotman, The Theory of Groups, Allyn and Bacon, Boston (1965).
H. Rogers, Theory of Recursive Functions and Effective Computability, McGraw-Hill, New York (1967).
Yu. L. Ershov, Numeration Theory [in Russian], Nauka, Moscow (1977).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Combarro, E.F. Automorphism Groups of Computably Enumerable Predicates. Algebra and Logic 41, 285–294 (2002). https://doi.org/10.1023/A:1020975619422
Issue Date:
DOI: https://doi.org/10.1023/A:1020975619422