Definability, Automorphisms, and Dynamic Properties of Computably Enumerable Sets
From MaRDI portal
Publication:4897042
DOI10.2307/421110zbMath0858.03044MaRDI 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
automorphism; definability; complete sets; recursively enumerable sets; computably enumerable sets; Post's problem; promptly simple set; noncreative sets
03D25: Recursively (computably) enumerable sets and degrees
Related Items
ON THE DEFINABILITY OF THE DOUBLE JUMP IN THE COMPUTABLY ENUMERABLE SETS, The nonlow computably enumerable degrees are not invariant in $\mathcal {E}$, On \(n\)-tardy sets, Extending and interpreting Post's programme, Computably enumerable sets and related issues, Definable properties of the computably enumerable sets, Degree invariance in the Π10classes
Cites Work