Towards a General Theory of Computability

Journal of Symbolic Logic 29 (1):63-64 (1964)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2269801

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,202

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 and recursion.Robert I. Soare - 1996 - Bulletin of Symbolic Logic 2 (3):284-321.
Towards a general theory of computability.Richard Montague - 1960 - Synthese 12 (4):429 - 438.
Computability Theory: An Introduction to Recursion Theory.Herbert B. Enderton - 2010 - Academic Press.
Remarks on the development of computability.Stewart Shapiro - 1983 - History and Philosophy of Logic 4 (1-2):203-220.
Review: Richard Montague, Towards a General Theory of Computability. [REVIEW]Martin Davis - 1964 - Journal of Symbolic Logic 29 (1):63-64.
Computability of String Functions Over Algebraic Structures Armin Hemmerling.Armin Hemmerling - 1998 - Mathematical Logic Quarterly 44 (1):1-44.
Computability and Randomness.André Nies - 2008 - Oxford, England: Oxford University Press UK.
Review of Denis R. Hirschfeldt, Slicing the Truth: On the Computability Theoretic and Reverse Mathematical Analysis of Combinatorial Principles. [REVIEW]Benedict Eastaugh - 2017 - Studia Logica 105 (4):873-879.
Set theory, model theory, and computability theory.Wilfrid Hodges - 2009 - In Leila Haaparanta (ed.), The Development of Modern Logic. Oxford University Press. pp. 471.
Counterpossibles in Science: The Case of Relative Computability.Matthias Jenny - 2018 - Noûs 52 (3):530-560.
Computability Theory.S. Barry Cooper - 2003 - Chapman & Hall.
Introduction to Computability Theory.D. Normann - 2010
Computability and Complexity: From a Programming Perspective Vol. 21.N. D. Jones - 1997 - MIT Press.
Lattice representations for computability theory.Peter A. Fejer - 1998 - Annals of Pure and Applied Logic 94 (1-3):53-74.
Computability of the ergodic decomposition.Mathieu Hoyrup - 2013 - Annals of Pure and Applied Logic 164 (5):542-549.

Analytics

Added to PP
2017-02-21

Downloads
6 (#1,383,956)

6 months
2 (#1,136,865)

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