An invariance notion in recursion theory

Journal of Symbolic Logic 47 (1):48-66 (1982)
  Copy   BIBTEX

Abstract

A set of godel numbers is invariant if it is closed under automorphisms of (ω, ·), where ω is the set of all godel 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

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,752

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Analytics

Added to PP
2009-01-28

Downloads
23 (#679,329)

6 months
15 (#164,728)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Effectivizing Inseparability.John Case - 1991 - Mathematical Logic Quarterly 37 (7):97-111.

Add more citations

References found in this work

Model Theory.Michael Makkai, C. C. Chang & H. J. Keisler - 1991 - Journal of Symbolic Logic 56 (3):1096.
Theory of Recursive Functions and Effective Computability.Hartley Rogers - 1971 - Journal of Symbolic Logic 36 (1):141-146.

Add more references