Author:
Harrington Leo,Soare Robert I.
Abstract
AbstractWe 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).
Publisher
Cambridge University Press (CUP)
Reference13 articles.
1. [4] Harrington L. and Soare R. I. , Codable sets and orbits of computably enumerable sets, Journal of Symbolic Logic , to appear.
2. [13] Soare R. I. , Computability and recursion, to appear, 1996.
3. [6] Harrington L. , Martins invariance conjecture and low sets, in preparation.
4. [7] Harrington L. , The -automorphism method and noninvariant classes of degrees, Journal of the American Mathematical Society , to appear.
5. Automorphisms of the lattice of recursively enumerable sets: promptly simple sets
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Degrees of Unsolvability;Computational Logic;2014
2. On n-tardy sets;Annals of Pure and Applied Logic;2012-09
3. Computably enumerable sets and related issues;Algebra and Logic;2012-01
4. Degree invariance in the Π10classes;The Journal of Symbolic Logic;2011-12
5. Extending and interpreting Post’s programme;Annals of Pure and Applied Logic;2010-03