Review: Robert W. Ritchie, Classes of Predictably Computable Functions [Book Review]

Journal of Symbolic Logic 28 (3):252-253 (1963)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2271077

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,590

External links

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

Through your library

My notes

Similar books and articles

Ritchie Robert W.. Classes of predictably computable functions. Transactions of the American Mathematical Society, vol. 106 , pp. 139–173. [REVIEW]C. C. Elgot - 1963 - Journal of Symbolic Logic 28 (3):252-253.
Review: D. L. Kreider, R. W. Ritchie, Predictably Computable Functionals and Definition by Recursion. [REVIEW]Paul Axt - 1968 - Journal of Symbolic Logic 33 (2):298-299.
Classes of Predictably Computable Functions.Robert W. Ritchie - 1963 - Journal of Symbolic Logic 28 (3):252-253.
Robert W. Ritchie. Classes of recursive functions based on Ackermann's function. Pacific journal of mathematics, vol. 15 , pp. 1027–1044. [REVIEW]Paul Axt - 1966 - Journal of Symbolic Logic 31 (4):654-654.
D. L. Kreider and R. W. Ritchie. Predictably computable functionals and definition by recursion. Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 10 , pp. 65–80. [REVIEW]Paul Axt - 1968 - Journal of Symbolic Logic 33 (2):298-299.
Review: C. C. Elgot, Decision Problems of Finite Automata Design and Related Arithmetics. [REVIEW]Robert McNaughton - 1969 - Journal of Symbolic Logic 34 (3):509-510.
Review: Calvin C. Elgot, On Single vs. Triple Address Computing Machines. [REVIEW]Raymond J. Nelson - 1956 - Journal of Symbolic Logic 21 (2):208-209.
Review: Irving M. Copi, Calvin C. Elgot, Jesse B. Wright, Realization of Events by Logical Nets. [REVIEW]Andrzej J. Blikle - 1967 - Journal of Symbolic Logic 32 (3):389-390.
Elgot C. C.. Decision problems of finite automata design and related arithmetics. Transactions of the American Mathematical Society, vol. 98 , pp. 21–51. [REVIEW]Robert McNaughton - 1969 - Journal of Symbolic Logic 34 (3):509-510.
Review: S. C. Kleene, A Note on Computable Functionals. [REVIEW]G. Kreisel - 1959 - Journal of Symbolic Logic 24 (1):51-52.

Analytics

Added to PP
2013-11-22

Downloads
10 (#395,257)

6 months
1 (#1,912,481)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Elementary Functions and LOOP Programs.Zlatan Damnjanovic - 1994 - Notre Dame Journal of Formal Logic 35 (4):496-522.

Add more citations

References found in this work

No references found.

Add more references