Publisher
Springer International Publishing
Reference12 articles.
1. Cholak, P.: Some recent research directions in the computably enumerable sets. To appear in the book “The Incomputable” in the Springer/CiE book series (2013)
2. Cholak, P., Downey, R., Herrmann, E.: Some orbits for
$$\cal{E}$$
. Ann. Pure Appl. Log. 107(1–3), 193–226 (2001). doi:
10.1016/S0168-0072(00)00060-9
. ISSN: 0168–0072
3. Cholak, P.A., Gerdes, P., Lange, K.:
$$\cal{D}$$
-maximal sets. J. Symb. Log. 80(4), 1182–1210 (2015). The Url is to the first unpublished version of this paper. The first and last citation of this paper are actually to this version.
arxiv:1401.1266v1
. ISSN: 0022–4812
4. Downey, R.G., Stob, M.: Automorphisms of the lattice of recursively enumerable sets: orbits. Adv. Math. 92, 237–265 (1992)
5. Friedberg, R.M.: Three theorems on recursive enumerationI. I. Decomposition. II. Maximal set. III. Enumeration without duplication. J. Symb. Logic 23, 309–316 (1958). ISSN: 0022–4812