Differences of Computably Enumerable Sets

Mathematical Logic Quarterly 46 (4):555-562 (2000)
  Copy   BIBTEX

Abstract

We consider the ower semilattice [MATHEMATICAL SCRIPT CAPITAL D] of differences of c.e. sets under inclusion. It is shown that [MATHEMATICAL SCRIPT CAPITAL D] is not distributive as a semilattice, and that the c.e. sets form a definable subclass

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,590

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

Computably enumerable sets and quasi-reducibility.R. Downey, G. LaForte & A. Nies - 1998 - Annals of Pure and Applied Logic 95 (1-3):1-35.
An Interval of Computably Enumerable Isolating Degrees.Matthew C. Salts - 1999 - Mathematical Logic Quarterly 45 (1):59-72.
Isolation and the Jump Operator.Guohua Wu - 2001 - Mathematical Logic Quarterly 47 (4):525-534.
Orbits of computably enumerable sets: low sets can avoid an upper cone.Russell Miller - 2002 - Annals of Pure and Applied Logic 118 (1-2):61-85.
On supersets of non-low sets.Klaus Ambos-Spies, Rod G. Downey & Martin Monath - 2021 - Journal of Symbolic Logic 86 (3):1282-1292.
Density of the Medvedev lattice of Π01 classes.Douglas Cenzer & Peter G. Hinman - 2003 - Archive for Mathematical Logic 42 (6):583-600.
Difference sets and computability theory.Rod Downey, Zoltán Füredi, Carl G. Jockusch & Lee A. Rubel - 1998 - Annals of Pure and Applied Logic 93 (1-3):63-72.

Analytics

Added to PP
2013-12-01

Downloads
17 (#213,731)

6 months
2 (#1,816,284)

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