Recursively Enumerable L‐Sets

Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 33 (2):107-113 (1987)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Other Versions

reprint Biacino, Loredana; Gerla, Giangiacomo (1987) "Recursively Enumerable L-Sets". Mathematical Logic Quarterly 33(2):107-113

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,505

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

Recursively Enumerable Images of Arithmetic Sets.Richard Rosenberg - 1982 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 28 (14-18):189-201.
Enumeration of some classes of recursively enumerable sets.Kempachiro Ohashi - 1964 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 10 (1):1-6.

Analytics

Added to PP
2013-12-01

Downloads
44 (#507,867)

6 months
3 (#1,475,474)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Citations of this work

Add more citations

References found in this work

Theory of Recursive Functions and Effective Computability.Hartley Rogers - 1971 - Journal of Symbolic Logic 36 (1):141-146.

Add more references