Article contents
An invariance notion in recursion theory1
Published online by Cambridge University Press: 12 March 2014
Abstract
A set of gödel numbers is invariant if it is closed under automorphisms of (ω, ·), where ω is the set of all gödel numbers of partial recursive functions and · is application (i.e., n · m ≃ φn(m)). The invariant arithmetic sets are investigated, and the invariant recursively enumerable sets and partial recursive functions are partially characterized.
- Type
- Research Article
- Information
- Copyright
- Copyright © Association for Symbolic Logic 1982
Footnotes
The author thanks the referee for a number of valuable suggestions.
References
REFERENCES
- 3
- Cited by