Definability, automorphisms, and dynamic properties of computably enumerable sets

Bulletin of Symbolic Logic 2 (2):199-213 (1996)
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)
DOI 10.2307/421110
 Save to my reading list
Follow the author(s)
Edit this record
My bibliography
Export citation
Find it on Scholar
Mark as duplicate
Request removal from index
Revision history
Download options
Our Archive

Upload a copy of this paper     Check publisher's policy     Papers currently archived: 31,334
Through your library
References found in this work BETA

No references found.

Add more references

Citations of this work BETA
Definable Properties of the Computably Enumerable Sets.Leo Harrington & Robert I. Soare - 1998 - Annals of Pure and Applied Logic 94 (1-3):97-125.
Extending and Interpreting Post’s Programme.S. Barry Cooper - 2010 - Annals of Pure and Applied Logic 161 (6):775-788.
On N -Tardy Sets.Peter A. Cholak, Peter M. Gerdes & Karen Lange - 2012 - Annals of Pure and Applied Logic 163 (9):1252-1270.
Degree Invariance in the [Image] Classes.Rebecca Weber - 2011 - Journal of Symbolic Logic 76 (4):1184 - 1210.

Add more citations

Similar books and articles
Recursively Enumerable Generic Sets.Wolfgang Maass - 1982 - Journal of Symbolic Logic 47 (4):809-823.
Structural Properties and Σ02 Enumeration Degrees.André Nies & Andrea Sorbi - 2000 - Journal of Symbolic Logic 65 (1):285 - 292.
Computability Results Used in Differential Geometry.Barbara F. Csima & Robert I. Soare - 2006 - Journal of Symbolic Logic 71 (4):1394 - 1410.
On Orbits of Prompt and Low Computably Enumerable Sets.Kevin Wald - 2002 - Journal of Symbolic Logic 67 (2):649-678.
Added to PP index

Total downloads
38 ( #152,300 of 2,225,225 )

Recent downloads (6 months)
1 ( #425,065 of 2,225,225 )

How can I increase my downloads?

Monthly downloads
My notes
Sign in to use this feature