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

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
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.2307/2273381
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy

Upload a copy of this paper     Check publisher's policy     Papers currently archived: 69,160
Through your library

References found in this work BETA

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

Citations of this work BETA

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

Add more citations

Similar books and articles


Added to PP index

Total views
8 ( #1,003,017 of 2,499,389 )

Recent downloads (6 months)
1 ( #418,195 of 2,499,389 )

How can I increase my downloads?


My notes