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
Post, E.: Recursively Enumerable Sets of Positive Integers and their Decision Problems. Bull. Amer. math. Soc. 50, 284–316 (1944).
Robinson, R. M.: Arithmetical Representation of Recursively Enumerable Sets. J. symbolic Logic 21, 162–186 (1956).
Rosser, B.: Extensions of Some Theorems of Gödel and Church. J. symbolic Logic 1, 87–91 (1936).
Smullyan, R. M.: Theory of Formal Systems. Princeton, N. J.: Princeton University Press 1961, revised edition 1963.
Kleene, S. C.: Recursive Predicates and Quantifiers. Trans. Amer. math. Soc. 53, 41–73 (1943).
Mostowski, A.: On Definable Sets of Positive Integers. Fundam. Math. 34, 81–112 (1947).
Mostowski, A.: On a Set of Integers not Definable by Means of One-Quantifier Predicates. Ann. Soc. Polonaise Math. 21, 114–119 (1948).
Kleene, S. C.: Introduction to Metamathematics. Amsterdam: North-Holland Publishing Company 31959.
Mostowski, A.: Development and Applications of the “Projective” Classification of Sets of Integers. Proc. internat. Congr. Math. Amsterdam 1 (1954).
Kleene, S. C.: Hierarchies of Number-Theoretic Predicates. Bull. Amer. math. Soc. 61, 193–213 (1955).
Davis, M.: Computability & Unsolvability. New York-Toronto-London: McGraw-Hill Book Company 1958.
Hilbert, D.: Mathematische Probleme. Vortrag, gehalten auf dem internationalen Mathematiker-Kongreß zu Paris 1900. Nachr. Ges. Wiss. Göttingen, math.phys. Kl., 253–297 (1900).
Davis, M.: Arithmetical Problems and Recursively Enumerable Predicates. J. symbolic Logic 18, 33–41 (1953).
Davis, M., and H. Putnam: Reductions of Hilbert’s Tenth Problem. J. symbolic Logic 23, 183–187 (1958).
Davis, M., and H. Putnam: Research on Hilbert’s Tenth Problem. Rensselaer Polytechnic Institute, Troy, N. Y., 3–1 to 3–31 (1959).
Davis, M.: Extensions and Corollaries of Recent Work on Hilbert’s Tenth Problem. Illinois J. Math. 7, 246–250 (1963).
Turing, A. M.: On Computable Numbers, with an Application to the Entscheidungsproblem. Proc. London math. Soc. (2), 42. 230–265 (1937).
Church, A.: The Calculi of Lambda-Conversion. Princeton: Princeton University Press 1941.
Curry, H. B., and R. Feys: Combinatory Logic. Amsterdam: North-Holland Publishing Company 1958.
Kleene, S. C.: R-Definability and Recursiveness. Duke math. J. 2, 340–353 (1936).
Turing, A. M.: Computability and 2-Definability. J. symbolic Logic 2, 153–163 (1937).
Fitch, F. B.: A Simplification of Basic Logic. J. symbolic Logic 18, 317–325 (1953) esp. p. 324, where the expressions Hi occur, for which we have used the notation Ai which reminds us of Church’s R.
Fitch, F. B.: Recursive Functions in Basic Logic. J. symbolic Logic 21, 337–346 (1956).
Lorenzen, P.: Einführung in die operative Logik und Mathematik. Berlin-Göttingen-Heidelberg: Springer 1955.
Hermes, H.: Zum Inversionsprinzip der operativen Logik. Constructivity in Mathematics, ed. by A. Heyting. pp. 62–68. Amsterdam: North-Holland Publishing Company 1959.
Post, E. L.: Formal Reductions of the General Combinatorial Decision Problem. Amer. J. Math. 65, 197–215 (1943). (Cf. the review by Church in: J. symbolic Logic 8, 50–52 (1943).)
D’Etlovs, V. K.: The normal algorithms and the recursive functions [Russ.]. Dokl. Akad. Nauk SSSR. 90, 723–725 (1953).
Markov, A. A.: Theory of algorithms [Russ.]. Akad. Nauk SSSR., Matém. Inst. Trudy 42, Moscow-Leningrad 1954.
Curry, H. B.: Calculuses and Formal Systems. Dialectica 12, 249–273 (1958).
Asser, G.: Normierte Postsche Algorithmen. Z. math. Logik 5, 323–333 (1959).
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
© 1969 Springer-Verlag Berlin · Heidelberg
About this chapter
Cite this chapter
Hermes, H. (1969). Miscellaneous. In: Enumerability · Decidability Computability. Die Grundlehren der mathematischen Wissenschaften, vol 127. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-46178-1_7
Download citation
DOI: https://doi.org/10.1007/978-3-642-46178-1_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-46180-4
Online ISBN: 978-3-642-46178-1
eBook Packages: Springer Book Archive