Anti‐Mitotic Recursively Enumerable Sets

Mathematical Logic Quarterly 31 (29-30):461-477 (1985)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1002/malq.19850312903

Links

PhilArchive



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

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

Anti‐Mitotic Recursively Enumerable Sets.Klaus Ambos-Spies - 1985 - Mathematical Logic Quarterly 31 (29-30):461-477.
Recursively enumerable generic sets.Wolfgang Maass - 1982 - Journal of Symbolic Logic 47 (4):809-823.
On the orbits of hyperhypersimple sets.Wolfgang Maass - 1984 - Journal of Symbolic Logic 49 (1):51-62.
Index sets in the arithmetical Hierarchy.Ulrike Brandt - 1988 - Annals of Pure and Applied Logic 37 (2):101-110.
On a Class of Recursively Enumerable Sets.Farzad Didehvar - 1999 - Mathematical Logic Quarterly 45 (4):467-470.
A non-splitting theorem for d.r.e. sets.Xiaoding Yi - 1996 - Annals of Pure and Applied Logic 82 (1):17-96.
Mitotic recursively enumerable sets.Richard E. Ladner - 1973 - Journal of Symbolic Logic 38 (2):199-211.
Splitting theorems for speed-up related to order of enumeration.A. M. Dawes - 1982 - Journal of Symbolic Logic 47 (1):1-7.
On recursive enumerability with finite repetitions.Stephan Wehner - 1999 - Journal of Symbolic Logic 64 (3):927-945.
Completely mitotic c.e. degrees and non-jump inversion.Evan J. Griffiths - 2005 - Annals of Pure and Applied Logic 132 (2-3):181-207.
Recursive constructions in topological spaces.Iraj Kalantari & Allen Retzlaff - 1979 - Journal of Symbolic Logic 44 (4):609-625.
The continuity of cupping to 0'.Klaus Ambos-Spies, Alistair H. Lachlan & Robert I. Soare - 1993 - Annals of Pure and Applied Logic 64 (3):195-209.
Definable structures in the lattice of recursively enumerable sets.E. Herrmann - 1984 - Journal of Symbolic Logic 49 (4):1190-1197.
Effective Nonrecursiveness.Takeshi Yamaguchi - 1997 - Mathematical Logic Quarterly 43 (1):45-48.
Degree theoretical splitting properties of recursively enumerable sets.Klaus Ambos-Spies & Peter A. Fejer - 1988 - Journal of Symbolic Logic 53 (4):1110-1137.

Analytics

Added to PP
2015-12-02

Downloads
30 (#547,804)

6 months
5 (#703,368)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Splitting theorems in recursion theory.Rod Downey & Michael Stob - 1993 - Annals of Pure and Applied Logic 65 (1):1-106.
Completely mitotic R.E. degrees.R. G. Downey & T. A. Slaman - 1989 - Annals of Pure and Applied Logic 41 (2):119-152.
Classifications of degree classes associated with r.e. subspaces.R. G. Downey & J. B. Remmel - 1989 - Annals of Pure and Applied Logic 42 (2):105-124.

View all 10 citations / Add more citations

References found in this work

Bounding minimal pairs.A. H. Lachlan - 1979 - Journal of Symbolic Logic 44 (4):626-642.
The infinite injury priority method.Robert I. Soare - 1976 - Journal of Symbolic Logic 41 (2):513-530.
Wtt-degrees and t-degrees of R.e. Sets.Michael Stob - 1983 - Journal of Symbolic Logic 48 (4):921-930.

View all 10 references / Add more references