Definability, Automorphisms, and Dynamic Properties of Computably Enumerable Sets

DOI10.2307/421110zbMath0858.03044OpenAlexW2168058676MaRDI QIDQ4897042

Robert I. Soare, Leo Harrington

Publication date: 19 March 1997

Published in: Bulletin of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: http://www.math.ucla.edu/~asl/bsl/0202-toc.htm

zbMATH Keywords

automorphismdefinabilitycomplete setsrecursively enumerable setscomputably enumerable setsPost's problempromptly simple setnoncreative sets

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25)

Related Items (7)

ON THE DEFINABILITY OF THE DOUBLE JUMP IN THE COMPUTABLY ENUMERABLE SETS ⋮ Extending and interpreting Post's programme ⋮ On \(n\)-tardy sets ⋮ The nonlow computably enumerable degrees are not invariant in $\mathcal {E}$ ⋮ Computably enumerable sets and related issues ⋮ Degree invariance in the Π₁⁰classes ⋮ Definable properties of the computably enumerable sets

Cites Work

• Unnamed Item
• Automorphisms of the lattice of recursively enumerable sets: Orbits
• Handbook of computability theory
• Post's program and incomplete recursively enumerable sets.

This page was built for publication: Definability, Automorphisms, and Dynamic Properties of Computably Enumerable Sets