Automorphisms of the lattice of recursively enumerable sets. Part II: Low sets

Annals of Mathematical Logic 22 (1):69 (1982)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



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

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

[Omnibus Review].Rod Downey - 1997 - Journal of Symbolic Logic 62 (3):1048-1055.
omnibus Review. [REVIEW]Rod Downey - 1997 - Journal of Symbolic Logic 62 (3):1048-1055.
Automorphisms of the lattice of recursively enumerable sets.Peter Cholak - 1995 - Providence, RI: American Mathematical Society.
On the orbits of hyperhypersimple sets.Wolfgang Maass - 1984 - Journal of Symbolic Logic 49 (1):51-62.
Definable structures in the lattice of recursively enumerable sets.E. Herrmann - 1984 - Journal of Symbolic Logic 49 (4):1190-1197.
Recursively enumerable generic sets.Wolfgang Maass - 1982 - Journal of Symbolic Logic 47 (4):809-823.
Index sets in the arithmetical Hierarchy.Ulrike Brandt - 1988 - Annals of Pure and Applied Logic 37 (2):101-110.
Effectively and Noneffectively Nowhere Simple Sets.Valentina S. Harizanov - 1996 - Mathematical Logic Quarterly 42 (1):241-248.
Orbits of hyperhypersimple sets and the lattice of ∑03 sets.E. Herrmann - 1983 - Journal of Symbolic Logic 48 (3):693 - 699.
Recursive constructions in topological spaces.Iraj Kalantari & Allen Retzlaff - 1979 - Journal of Symbolic Logic 44 (4):609-625.
On a Class of Recursively Enumerable Sets.Farzad Didehvar - 1999 - Mathematical Logic Quarterly 45 (4):467-470.
On orbits, of prompt and low computably enumerable sets.Kevin Wald - 2002 - Journal of Symbolic Logic 67 (2):649-678.
A non-splitting theorem for d.r.e. sets.Xiaoding Yi - 1996 - Annals of Pure and Applied Logic 82 (1):17-96.
On a Class of Recursively Enumerable Sets.Farzad Didevhar - 1999 - Mathematical Logic Quarterly 45 (4):467-470.

Analytics

Added to PP
2014-01-17

Downloads
19 (#778,470)

6 months
3 (#992,474)

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.
Countable thin Π01 classes.Douglas Cenzer, Rodney Downey, Carl Jockusch & Richard A. Shore - 1993 - Annals of Pure and Applied Logic 59 (2):79-139.
On strongly jump traceable reals.Keng Meng Ng - 2008 - Annals of Pure and Applied Logic 154 (1):51-69.
Definable properties of the computably enumerable sets.Leo Harrington & Robert I. Soare - 1998 - Annals of Pure and Applied Logic 94 (1-3):97-125.

View all 11 citations / Add more citations

References found in this work

Recursively enumerable generic sets.Wolfgang Maass - 1982 - Journal of Symbolic Logic 47 (4):809-823.
Computational complexity, speedable and levelable sets.Robert I. Soare - 1977 - Journal of Symbolic Logic 42 (4):545-563.
The infinite injury priority method.Robert I. Soare - 1976 - Journal of Symbolic Logic 41 (2):513-530.

View all 20 references / Add more references