American Mathematical Society (1995)

Abstract
Chapter 1: Introduction. S = <{We}c<w; C,U,n,0,w> is the substructure formed by restricting the lattice <^P(w); C , U, n,0,w> to the re subsets We of the ...
Keywords Recursively enumerable sets  Automorphisms  Lattice theory
Categories (categorize this paper)
Buy this book Find it on Amazon.com
Call number QA9.615.A57 no. 541
ISBN(s) 0821826018   9780821826010
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 64,262
External links

Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library

References found in this work BETA

No references found.

Add more references

Citations of this work BETA

Splitting Theorems in Recursion Theory.Rod Downey & Michael Stob - 1993 - Annals of Pure and Applied Logic 65 (1):1-106.
Highness and Bounding Minimal Pairs.Rodney G. Downey, Steffen Lempp & Richard A. Shore - 1993 - Mathematical Logic Quarterly 39 (1):475-491.
Definable Properties of the Computably Enumerable Sets.Leo Harrington & Robert I. Soare - 1998 - Annals of Pure and Applied Logic 94 (1-3):97-125.
The Translation Theorem.Peter Cholak - 1994 - Archive for Mathematical Logic 33 (2):87-108.

View all 12 citations / Add more citations

Similar books and articles

Analytics

Added to PP index
2009-01-28

Total views
13 ( #749,361 of 2,455,626 )

Recent downloads (6 months)
1 ( #449,205 of 2,455,626 )

How can I increase my downloads?

Downloads

My notes