Automorphisms of the Lattice of Recursively Enumerable Sets

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 the book $19.95 used (54% off)   $20.00 new (54% off)   $43.00 direct from Amazon    Amazon page
Call number QA9.615.A57 no. 541
ISBN(s) 0821826018   9780821826010
Options
 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: 10,788
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.

Citations of this work BETA
S. Barry Cooper (2010). Extending and Interpreting Post's Programme. Annals of Pure and Applied Logic 161 (6):775-788.
Similar books and articles
Analytics

Monthly downloads

Added to index

2009-01-28

Total downloads

5 ( #224,470 of 1,099,028 )

Recent downloads (6 months)

2 ( #175,277 of 1,099,028 )

How can I increase my downloads?

My notes
Sign in to use this feature


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