Arithmetical problems and recursively enumerable predicates

Journal of Symbolic Logic 18 (1):33-41 (1953)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Other Versions

reprint Davis, Martin (1953) "Arithmetical Problems and Recursively Enumerable Predicates". Journal of Symbolic Logic 18(4):341-342

Links

PhilArchive

    This entry is not archived by us. If you are the author and have permission from the publisher, we recommend that you archive it. Many publishers automatically grant permission to authors to archive pre-prints. By uploading a copy of your work, you will enable us to better index it, making it easier to find.

    Upload a copy of this work     Papers currently archived: 104,599

External links

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

Through your library

Analytics

Added to PP
2009-01-28

Downloads
36 (#695,470)

6 months
9 (#446,864)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Extending and interpreting Post’s programme.S. Barry Cooper - 2010 - Annals of Pure and Applied Logic 161 (6):775-788.
Hilbert's problems.J. Fang - 1969 - Philosophia Mathematica (1-2):38-53.
Extending and interpreting Post’s programme.S. Cooper - 2010 - Annals of Pure and Applied Logic 161 (6):775-788.

View all 8 citations / Add more citations

References found in this work

Extensions of some theorems of gödel and church.Barkley Rosser - 1936 - Journal of Symbolic Logic 1 (3):87-91.

Add more references