You are not currently logged in.
Access JSTOR through your library or other institution:
If You Use a Screen ReaderThis content is available through Read Online (Free) program, which relies on page scans. Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
Definability, Automorphisms, and Dynamic Properties of Computably Enumerable Sets
Leo Harrington and Robert I. Soare
The Bulletin of Symbolic Logic
Vol. 2, No. 2 (Jun., 1996), pp. 199-213
Published by: Association for Symbolic Logic
Stable URL: http://www.jstor.org/stable/421110
Page Count: 15
You can always find the topics here!Topics: Automorphisms, Mathematical functions, Information content, Definability, Mathematical sets, Recursively enumerable sets, Mathematical logic, Computability, Recursion theory, Terminology
Were these topics helpful?See somethings inaccurate? Let us know!
Select the topics that are inaccurate.
Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
Preview not available
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).
The Bulletin of Symbolic Logic © 1996 Association for Symbolic Logic