Ritchie Robert W.. Classes of predictably computable functions. Transactions of the American Mathematical Society, vol. 106 , pp. 139–173 [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: 91,386

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

Review: Robert W. Ritchie, Classes of Predictably Computable Functions. [REVIEW]C. C. Elgot - 1963 - Journal of Symbolic Logic 28 (3):252-253.
Classes of Predictably Computable Functions.Robert W. Ritchie - 1963 - Journal of Symbolic Logic 28 (3):252-253.
H‐monotonically computable real numbers.Xizhong Zheng, Robert Rettinger & George Barmpalias - 2005 - Mathematical Logic Quarterly 51 (2):157-170.
Predictably computable functionals and definition by recursion.D. L. Kreider & R. W. Ritchie - 1964 - Mathematical Logic Quarterly 10 (5):65-80.
Effectively closed sets and enumerations.Paul Brodhead & Douglas Cenzer - 2008 - Archive for Mathematical Logic 46 (7-8):565-582.
Bounded iteration and unary functions.Stefano Mazzanti - 2005 - Mathematical Logic Quarterly 51 (1):89-94.
Alan Rose and J. Barkley Rosser. Fragments of many-valued statement calculi. Transactions of the American Mathematical Society, vol. 87 , pp. 1–53. - C. A. Meredith. The dependence of an axiom of Łukasiewicz. Transactions of the American Mathematical Society, vol. 87 , p. 54. - C. C. Chang. Proof of an axiom of Łukasiewicz. Transactions of the American Mathematical Society, vol. 87 , pp. 55–56. [REVIEW]Atwell R. Turquette - 1959 - Journal of Symbolic Logic 24 (3):248-249.
Predictably computable functionals and definition by recursion.D. L. Kreider & R. W. Ritchie - 1964 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 10 (5):65-80.
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.
Computability & unsolvability.Martin Davis - 1958 - New York: Dover Publications.
Derivatives of Computable Functions.Ning Zhong - 1998 - Mathematical Logic Quarterly 44 (3):304-316.
When series of computable functions with varying domains are computable.Iraj Kalantari & Larry Welch - 2013 - Mathematical Logic Quarterly 59 (6):471-493.
The $\mu$ -measure as a tool for classifying computational complexity.Karl-Heinz Niggl - 2000 - Archive for Mathematical Logic 39 (7):515-539.
On the convergence of Fourier series of computable Lebesgue integrable functions.Philippe Moser - 2010 - Mathematical Logic Quarterly 56 (5):461-469.
Rabin M. O.. Computable algebraic systems. Summaries of talks presented at the Summer Institute for Symbolic Logic, Cornell University, 1957, 2nd edn., Communications Research Division, Institute for Defense Analyses, Princeton, N.J., 1960, pp. 134–138.Rabin Michael O.. Computable algebra, general theory and theory of computable fields. Transactions of the American Mathematical Society, vol. 95 , pp. 341–360. [REVIEW]B. H. Mayoh - 1967 - Journal of Symbolic Logic 32 (3):412-413.

Analytics

Added to PP
2016-06-30

Downloads
12 (#1,062,297)

6 months
1 (#1,516,429)

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