Definability, automorphisms, and dynamic properties of computably enumerable sets

Bulletin of Symbolic Logic 2 (2):199-213 (1996)
Abstract
We announce and explain recent results on the computably enumerable (c.e.) sets, especially their definability properties (as sets in the spirit of Cantor), their automorphisms (in the spirit of Felix Klein's Erlanger Programm), their dynamic properties, expressed in terms of how quickly elements enter them relative to elements entering other sets, and the Martin Invariance Conjecture on their Turing degrees, i.e., their information content with respect to relative computability (Turing reducibility)
Keywords No keywords specified (fix it)
Categories (categorize this paper)
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,768
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.
Peter A. Cholak, Peter M. Gerdes & Karen Lange (2012). On N-Tardy Sets. Annals of Pure and Applied Logic 163 (9):1252-1270.
Similar books and articles
Analytics

Monthly downloads

Added to index

2009-01-28

Total downloads

7 ( #183,895 of 1,098,984 )

Recent downloads (6 months)

6 ( #43,600 of 1,098,984 )

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.