Bulletin of Symbolic Logic
- Bull. Symbolic Logic
- Volume 2, Number 2 (1996), 199-213.
Definability, Automorphisms, and Dynamic Properties of Computably Enumerable Sets
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).
Bull. Symbolic Logic, Volume 2, Number 2 (1996), 199-213.
First available in Project Euclid: 20 June 2007
Permanent link to this document
Mathematical Reviews number (MathSciNet)
Zentralblatt MATH identifier
Harrington, Leo; Soare, Robert I. Definability, Automorphisms, and Dynamic Properties of Computably Enumerable Sets. Bull. Symbolic Logic 2 (1996), no. 2, 199--213. https://projecteuclid.org/euclid.bsl/1182353439