Recursively Enumerable Classes and Their Application to Recursive Sequences of Formal Theories

, , &
Journal of Symbolic Logic 38 (1):155-156 (1973)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2271754

Other Versions

original Pour-El, Marian Boykan; Putnam, Hilary (1965) "Recursively enumerable classes and their application to recursive sequences of formal theories". Archive for Mathematical Logic 8(3-4):104-121

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 96,515

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

Recursively enumerable classes and their application to recursive sequences of formal theories.Marian Boykan Pour-El & Hilary Putnam - 1965 - Archive for Mathematical Logic 8 (3-4):104-121.
Marian Boykan Pour-El and Hilary Putnam. Recursively enumerable classes and their application to recursive sequences of formal theories. Archiv für mathematische Logik und Grundlagenforschung, vol. 8 no. 3–4 , pp. 104–121. - Marian Boykan Pour-El and William A. Howard. A structural criterion for recursive enumeration without repetition. Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 10 , pp. 105–114. - A. H. Lachlan. On recursive enumeration without repetition. Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 11 , pp. 209–220. - A. H. Lachlan. On recursive enumeration without repetition: a correction. Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 13 , pp. 99–100. [REVIEW]James C. Owings - 1973 - Journal of Symbolic Logic 38 (1):155-156.
A. H. Lachlan. The impossibility of finding relative complements for recursively enumerable degrees. The journal of symbolic logic, vol. 31 , pp. 434–454. [REVIEW]Gerald E. Sacks - 1971 - Journal of Symbolic Logic 36 (3):539-540.
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.

Analytics

Added to PP
2015-02-05

Downloads
21 (#870,057)

6 months
6 (#1,139,313)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Theorie der Numerierungen I.Ju L. Eršov - 1973 - Mathematical Logic Quarterly 19 (19‐25):289-388.

Add more citations

References found in this work

No references found.

Add more references