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)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,923

External links

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

Through your library

Similar books and articles

On recursive enumerability with finite repetitions.Stephan Wehner - 1999 - Journal of Symbolic Logic 64 (3):927-945.
A non-splitting theorem for d.r.e. sets.Xiaoding Yi - 1996 - Annals of Pure and Applied Logic 82 (1):17-96.
Splittings of 0' into the Recursively Enumerable Degrees.Xiaoding Yi - 1996 - Mathematical Logic Quarterly 42 (1):249-269.
On a Class of Recursively Enumerable Sets.Farzad Didehvar - 1999 - Mathematical Logic Quarterly 45 (4):467-470.
Difference Sets and Recursion Theory.James H. Schmerl - 1998 - Mathematical Logic Quarterly 44 (4):515-521.
Recursive and recursively enumerable manifolds. I.Vladeta Vučković - 1977 - Notre Dame Journal of Formal Logic 18 (2):265-291.
Recursive and recursively enumerable manifolds. II.Vladeta Vučković - 1977 - Notre Dame Journal of Formal Logic 18 (3):383-405.
Recursive constructions in topological spaces.Iraj Kalantari & Allen Retzlaff - 1979 - Journal of Symbolic Logic 44 (4):609-625.

Analytics

Added to PP
2015-02-05

Downloads
19 (#822,759)

6 months
4 (#859,620)

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