Abstract
We shall show that every recursive predicate is arithmetical. Thus, the arithmetical predicates introduced in § 27.1 are generalizations of recursive predicates. We can divide (§ 29) the arithmetical predicates into classes (which have elements in common) where the smallest class is that of the recursive and a further class is that of the recursively enumerable predicates which we shall discuss in § 28.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Specker, E.: Nicht konstruktiv beweisbare Sätze der Analysis. J. symbolic Logic 14, 145–158 1949).
Myhill, J.: Criteria of Constructibility for Real Numbers. J. symbolic Logic 18, 7–10 (1953).
Grzegorczyk, A.: On the Definition of Computable Functionals. Fundam. Math. 42, 232–239 (1955).
Klaua, D.: Konstruktive Analysis. Berlin: VEB Deutscher Verlag der Wissenschaften 1961.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1965 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hermes, H. (1965). Miscellaneous. In: Enumerability · Decidability Computability. Die Grundlehren der Mathematischen Wissenschaften, vol 127. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-11686-9_7
Download citation
DOI: https://doi.org/10.1007/978-3-662-11686-9_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-11688-3
Online ISBN: 978-3-662-11686-9
eBook Packages: Springer Book Archive