Arithmetical problems and recursively enumerable predicates

Journal of Symbolic Logic 18 (1):33-41 (1953)
Abstract This article has no associated abstract. (fix it)
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.2307/2266325
Options
 Save to my reading list
Follow the author(s)
Edit this record
My bibliography
Export citation
Find it on Scholar
Mark as duplicate
Request removal from index
Revision history
Download options
Our Archive


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 31,786
Through your library
References found in this work BETA
Extensions of Some Theorems of Gödel and Church.Barkley Rosser - 1936 - Journal of Symbolic Logic 1 (3):87-91.

Add more references

Citations of this work BETA
Zur Benutzung der Verkettung als Basis für die Arithmetik.Michael Deutsch - 1975 - Mathematical Logic Quarterly 21 (1):145-158.
Extending and Interpreting Post’s Programme.S. Barry Cooper - 2010 - Annals of Pure and Applied Logic 161 (6):775-788.
Existential Arithmetization of Diophantine Equations.Yuri Matiyasevich - 2009 - Annals of Pure and Applied Logic 157 (2-3):225-233.

Add more citations

Similar books and articles
Recursive Constructions in Topological Spaces.Iraj Kalantari & Allen Retzlaff - 1979 - Journal of Symbolic Logic 44 (4):609-625.
Recursively Enumerable Generic Sets.Wolfgang Maass - 1982 - Journal of Symbolic Logic 47 (4):809-823.
Complementation in the Turing Degrees.Theodore A. Slaman & John R. Steel - 1989 - Journal of Symbolic Logic 54 (1):160-176.
On the Orbits of Hyperhypersimple Sets.Wolfgang Maass - 1984 - Journal of Symbolic Logic 49 (1):51-62.
On Recursive Enumerability with Finite Repetitions.Stephan Wehner - 1999 - Journal of Symbolic Logic 64 (3):927-945.
Added to PP index
2009-01-28

Total downloads
15 ( #359,013 of 2,231,535 )

Recent downloads (6 months)
1 ( #445,507 of 2,231,535 )

How can I increase my downloads?

Monthly downloads
My notes
Sign in to use this feature