Automorphisms of the Lattice of Recursively Enumerable Sets

American Mathematical Society (1995)
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 the book $37.74 used (18% off)   $38.58 new (17% off)   $46.00 direct from Amazon    Amazon page
Call number QA9.615.A57 no. 541
ISBN(s) 0821826018   9780821826010
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history Request removal from index
Download options
PhilPapers Archive

Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 16,707
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
Rod Downey (1997). On the Universal Splitting Property. Mathematical Logic Quarterly 43 (3):311-320.
S. Barry Cooper (2010). Extending and Interpreting Post's Programme. Annals of Pure and Applied Logic 161 (6):775-788.

View all 6 citations / Add more citations

Similar books and articles

Monthly downloads

Added to index


Total downloads

7 ( #304,000 of 1,726,249 )

Recent downloads (6 months)

1 ( #369,877 of 1,726,249 )

How can I increase my downloads?

My notes
Sign in to use this feature

Start a new thread
There  are no threads in this forum
Nothing in this forum yet.