Definable encodings in the computably enumerable sets - researchr publication related

researchr

You are not signed in
Sign in
Sign up

Peter Cholak, Leo Harrington. Definable encodings in the computably enumerable sets. Bulletin of Symbolic Logic, 6(2):185-196, 2000. [doi]

The following publications are possibly variants of this publication:

Definable Properties of the Computably Enumerable SetsLeo Harrington, Robert I. Soare. APAL, 94(1-3):97-125, 1998.

Definability, automorphisms, and dynamic properties of computably enumerable setsLeo Harrington, Robert I. Soare. bsl, 2(2):199-213, 1996. [doi]

On the Definability of the double jump in the computably Enumerable SetsPeter A. Cholak, Leo Harrington. jml, 2(2), 2002. [doi]

On Splits of Computably Enumerable SetsPeter A. Cholak. BIRTHDAY 2017: 521-535 [doi]

runs on WebDSL