Theory of provable recursive functions
HTML articles powered by AMS MathViewer
- by Patrick C. Fischer PDF
- Trans. Amer. Math. Soc. 117 (1965), 494-520 Request permission
References
-
C. F. Kent, Algebraic structures of some groups of recursive permutations, Doctoral thesis, Massachusetts Institute of Technology, Cambridge, Mass., 1960.
H. Rogers, Jr., Provable recursive functions, Bull. Amer. Math. Soc. 63 (1957), 140.
—, Theory of recursive functions and effective computability, Vol.I, Mimeographed Notes, Massachusetts Institute of Technology, Cambridge, Mass., 1957.
- Hartley Rogers Jr., The present theory of Turing machine computability, J. Soc. Indust. Appl. Math. 7 (1959), 114–130. MR 99923, DOI 10.1137/0107009 —, Recursive functions and effective computability, to be published by McGraw-Hill.
- Martin Davis, Computability and unsolvability, McGraw-Hill Series in Information Processing and Computers, McGraw-Hill Book Co., Inc., New York-Toronto-London, 1958. MR 0124208
- Stephen Cole Kleene, Introduction to metamathematics, D. Van Nostrand Co., Inc., New York, N. Y., 1952. MR 0051790 D. L. Kreider, Topics in the foundations of mathematics, Dittoed Course Notes, Massachusetts Institute of Technology, Cambridge, Mass., 1959. G. Kreisel, On the interpretation of non-finitist proofs, J. Symbolic Logic 16 (1951), 241-267, ibid. 17 (1952), 43-58.
- G. Kreisel, Mathematical significance of consistency proofs, J. Symbolic Logic 23 (1958), 155–182. MR 115912, DOI 10.2307/2964396 —, Personal communication to H. Rogers, Jr. (December, 1956). C. F. Kent, Personal communication (November, 1961).
Additional Information
- © Copyright 1965 American Mathematical Society
- Journal: Trans. Amer. Math. Soc. 117 (1965), 494-520
- MSC: Primary 02.70
- DOI: https://doi.org/10.1090/S0002-9947-1965-0175771-6
- MathSciNet review: 0175771