Review: Martin Davis, Arithmetical Problems and Recursively Enumerable Predicates [Book Review]

Journal of Symbolic Logic 18 (4):341-342 (1953)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2266587

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

Arithmetical problems and recursively enumerable predicates.Martin Davis - 1953 - Journal of Symbolic Logic 18 (1):33-41.
Review: J. C. E. Dekker, J. Myhill, Some Theorems on Classes of Recursively Enumerable Sets. [REVIEW]Martin Davis - 1962 - Journal of Symbolic Logic 27 (1):84-84.
Review: J. C. E. Dekker, Two Notes on Recursively Enumerable Sets. [REVIEW]Martin Davis - 1955 - Journal of Symbolic Logic 20 (1):73-74.
Review: H. G. Rice, Recursive and Recursively Enumerable Orders. [REVIEW]Martin Davis - 1957 - Journal of Symbolic Logic 22 (4):375-375.
On recursive enumerability with finite repetitions.Stephan Wehner - 1999 - Journal of Symbolic Logic 64 (3):927-945.
Arithmetical interpretations and Kripke frames of predicate modal logic of provability.Taishi Kurahashi - 2013 - Review of Symbolic Logic 6 (1):1-18.
Randomness and Recursive Enumerability.Siam J. Comput - unknown
Review: Ju. V. Matijasevic, F. M. Goldware, Diophantine Representation of Enumerable Predicates. [REVIEW]Martin Davis - 1974 - Journal of Symbolic Logic 39 (3):605-605.
On the orbits of hyperhypersimple sets.Wolfgang Maass - 1984 - Journal of Symbolic Logic 49 (1):51-62.
Complementation in the Turing degrees.Theodore A. Slaman & John R. Steel - 1989 - Journal of Symbolic Logic 54 (1):160-176.
Review: Yu. V. Matijasevic, Diophantine Representation of Recursively Enumerable Predicates. [REVIEW]Alonzo Church - 1972 - Journal of Symbolic Logic 37 (3):606-607.
Review: Yu. V. Matijasevic, J. E. Fenstad, Diophantine Representation of Recursively Enumerable Predicates. [REVIEW]Ann S. Ferebee - 1972 - Journal of Symbolic Logic 37 (3):606-606.
Recursively enumerable generic sets.Wolfgang Maass - 1982 - Journal of Symbolic Logic 47 (4):809-823.
Arithmetical representation of recursively enumerable sets.Raphael M. Robinson - 1956 - Journal of Symbolic Logic 21 (2):162-186.

Analytics

Added to PP
2013-11-22

Downloads
13 (#1,010,467)

6 months
4 (#790,687)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Fragments of R-Mingle.W. J. Blok & J. G. Raftery - 2004 - Studia Logica 78 (1-2):59-106.

Add more citations

References found in this work

No references found.

Add more references