Jumps of nontrivial splittings of recursively enumerable sets

Mathematical Logic Quarterly 36 (4):285-292 (1990)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Other Versions

reprint Ingrassia, Michael A.; Lempp, Steffen (1990) "Jumps of nontrivial splittings of recursively enumerable sets". Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 36(4):285-292

Links

PhilArchive



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

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

A Dichotomy of the Recursively Enumerable Sets.Robert W. Robinson - 1968 - Mathematical Logic Quarterly 14 (21-24):339-356.
On speedability of recursively enumerable sets.Ivan Marques - 1975 - Mathematical Logic Quarterly 21 (1):199-214.
Recursively Enumerable Sets and Retracing Functions.C. E. M. Yates - 1962 - Mathematical Logic Quarterly 8 (3-4):331-345.
On a Class of Recursively Enumerable Sets.Farzad Didevhar - 1999 - Mathematical Logic Quarterly 45 (4):467-470.
Anti‐Mitotic Recursively Enumerable Sets.Klaus Ambos-Spies - 1985 - Mathematical Logic Quarterly 31 (29-30):461-477.

Analytics

Added to PP
2013-11-02

Downloads
42 (#533,951)

6 months
4 (#1,252,858)

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.
Splitting theorems and the jump operator.R. G. Downey & Richard A. Shore - 1998 - Annals of Pure and Applied Logic 94 (1-3):45-52.

Add more citations

References found in this work

Add more references