Review: Richard L. Epstein, Walter A. Carnielli, Computability. Computable Functions, Logic, and the Foundations of Mathematics ; Richard L. Epstein, Walter A. Carnielli, Computability. Computable Functions, Logic, and the Foundations of Mathematics. Second Edition of the Preceding [Book Review]

Bulletin of Symbolic Logic 8 (1):101-104 (2002)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2178/bsl/1182353860

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

Computability & unsolvability.Martin Davis - 1958 - New York: Dover Publications.
Computability and Logic.George Boolos, John Burgess, Richard P. & C. Jeffrey - 1980 - New York: Cambridge University Press. Edited by John P. Burgess & Richard C. Jeffrey.
Alan Turing and the foundations of computable analysis.Guido Gherardi - 2011 - Bulletin of Symbolic Logic 17 (3):394-430.
Computability, an introduction to recursive function theory.Nigel Cutland - 1980 - New York: Cambridge University Press.
Computability and logic.Daniel E. Cohen - 1987 - New York: Halsted Press.
Computability and recursion.Robert I. Soare - 1996 - Bulletin of Symbolic Logic 2 (3):284-321.
Book review: Yves nievergelt, foundations of logic and mathematics: Applications to computer science and cryptography, birkäuser verlag, boston, 2002, €90, pp. 480, ISBN 0-8176-4249-8, hardcover. Dimensions (in inches): 1.00 × 9.96 × 7.36. [REVIEW]Walter A. Carnielli - 2004 - Studia Logica 78 (3):479-481.
Computability in Context: Computation and Logic in the Real World.S. B. Cooper & Andrea Sorbi (eds.) - 2011 - World Scientific.
Degrees of Unsolvability of Continuous Functions.Joseph S. Miller - 2004 - Journal of Symbolic Logic 69 (2):555 - 584.
Non-classical logics, model theory, and computability: proceedings of the Third Latin-American Symposium on Mathematical Logic, Campinas, Brazil, July 11-17, 1976.Ayda I. Arruda, Newton C. A. Costa & R. Chuaqui (eds.) - 1977 - New York: sale distributors for the U.S.A. and Canada, Elsevier/North-Holland.
A natural axiomatization of computability and proof of Church’s thesis.Nachum Dershowitz & Yuri Gurevich - 2008 - Bulletin of Symbolic Logic 14 (3):299-350.
Uniformly reflexive structures: towards an abstract theory of computability.Eric Gerhardt Wagner - 1963 - [New York: [S.N.].
Polynomial time operations in explicit mathematics.Thomas Strahm - 1997 - Journal of Symbolic Logic 62 (2):575-594.

Analytics

Added to PP
2010-08-30

Downloads
24 (#639,942)

6 months
11 (#222,787)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references