Strong enumeration properties of recursively enumerable classes

Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 15 (7-12):181-192 (1969)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1002/malq.19690150712

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,349

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

On recursive enumerability with finite repetitions.Stephan Wehner - 1999 - Journal of Symbolic Logic 64 (3):927-945.
Strong enumeration properties of recursively enumerable classes.J. B. Florence - 1969 - Mathematical Logic Quarterly 15 (7‐12):181-192.
Splitting theorems for speed-up related to order of enumeration.A. M. Dawes - 1982 - Journal of Symbolic Logic 47 (1):1-7.
The Index Set of Injectively Enumerable Classes of Recursively Enumerable Sets in ∑5‐Complete.Stephan Wehner - 1994 - Mathematical Logic Quarterly 40 (1):87-94.
Enumeration of some classes of recursively enumerable sets.Kempachiro Ohashi - 1964 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 10 (1):1-6.
Complete, Recursively Enumerable Relations in Arithmetic.Giovanna D'Agostino & Mario Magnago - 1995 - Mathematical Logic Quarterly 41 (1):65-72.
Strong Minimal Covers for Recursively Enumerable Degrees.S. Barry Cooper - 1996 - Mathematical Logic Quarterly 42 (1):191-196.
On a Class of Recursively Enumerable Sets.Farzad Didehvar - 1999 - Mathematical Logic Quarterly 45 (4):467-470.
Index sets for Π01 classes.Douglas Cenzer & Jeffrey Remmel - 1998 - Annals of Pure and Applied Logic 93 (1-3):3-61.
A non-splitting theorem for d.r.e. sets.Xiaoding Yi - 1996 - Annals of Pure and Applied Logic 82 (1):17-96.
On injective enumerability of recursively enumerable classes of cofinite sets.Stephan Wehner - 1995 - Archive for Mathematical Logic 34 (3):183-196.
The density of infima in the recursively enumerable degrees.Theodore A. Slaman - 1991 - Annals of Pure and Applied Logic 52 (1-2):155-179.
Recursive versus recursively enumerable binary relations.Dev K. Roy - 1993 - Studia Logica 52 (4):587 - 593.
Recursive constructions in topological spaces.Iraj Kalantari & Allen Retzlaff - 1979 - Journal of Symbolic Logic 44 (4):609-625.
On the orbits of hyperhypersimple sets.Wolfgang Maass - 1984 - Journal of Symbolic Logic 49 (1):51-62.

Analytics

Added to PP
2016-02-04

Downloads
22 (#688,104)

6 months
2 (#1,263,261)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references