Major subsets and automorphisms of recursively enumerable sets

In Anil Nerode & Richard A. Shore (eds.), Recursion Theory. American Mathematical Society. pp. 21 (1985)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

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

Automorphisms of the lattice of recursively enumerable sets.Peter Cholak - 1995 - Providence, RI: American Mathematical Society.
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.
The intervals of the lattice of recursively enumerable sets determined by major subsets.Wolfgang Maass & Michael Stob - 1983 - Annals of Pure and Applied Logic 24 (2):189-212.
Some theorems on r-maximal sets and major subsets of recursively enumerable sets.Manuel Lerman - 1971 - Journal of Symbolic Logic 36 (2):193-215.
Recursive constructions in topological spaces.Iraj Kalantari & Allen Retzlaff - 1979 - Journal of Symbolic Logic 44 (4):609-625.
Major subsets and the lattice of recursively enumerable sets.Michael Stob - 1985 - In Anil Nerode & Richard A. Shore (eds.), Recursion Theory. American Mathematical Society. pp. 107.
On orbits, of prompt and low computably enumerable sets.Kevin Wald - 2002 - Journal of Symbolic Logic 67 (2):649-678.
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.
Low sets without subsets of higher many-one degree.Patrizio Cintioli - 2011 - Mathematical Logic Quarterly 57 (5):517-523.
Definable structures in the lattice of recursively enumerable sets.E. Herrmann - 1984 - Journal of Symbolic Logic 49 (4):1190-1197.
The role of true finiteness in the admissible recursively enumerable degrees.Noam Greenberg - 2005 - Bulletin of Symbolic Logic 11 (3):398-410.
On a Class of Recursively Enumerable Sets.Farzad Didehvar - 1999 - Mathematical Logic Quarterly 45 (4):467-470.

Analytics

Added to PP
2014-01-31

Downloads
9 (#1,219,856)

6 months
3 (#1,023,809)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Effectively inseparable Boolean algebras in lattices of sentences.V. Yu Shavrukov - 2010 - Archive for Mathematical Logic 49 (1):69-89.
Definable structures in the lattice of recursively enumerable sets.E. Herrmann - 1984 - Journal of Symbolic Logic 49 (4):1190-1197.

Add more citations

References found in this work

No references found.

Add more references