Definable encodings in the computably enumerable sets

Definable encodings in the computably enumerable sets (2000)

Cached

Download Links

[www.nd.edu]
[www.nd.edu]

Other Repositories/Bibliography

DBLP

by Peter A. Cholak , Leo , A. Harrington

Venue:	Bull. Symbolic Logic
Citations:	5 - 4 self

BibTeX

@ARTICLE{Cholak00definableencodings,
    author = {Peter A. Cholak and Leo and A. Harrington},
    title = {Definable encodings in the computably enumerable sets},
    journal = {Bull. Symbolic Logic},
    year = {2000},
    pages = {2--1}
}

Bookmark

OpenURL

Abstract

The purpose of this communication is to announce some recent results on the computably enumerable sets. There are two disjoint sets of results; the first involves invariant classes and the second involves automorphisms of the computably enumerable sets. What these results have in common is

Citations

411	Recursively Enumerable Sets and Degrees - Soare - 1987
43	Classes of recursively enumerable sets and degrees of unsolvability - Martin - 1966
30	Automorphisms of the lattice of recursively enumerable sets: Orbits - Downey, Stob - 1992
21	On the lattice of recursively enumerable sets - Lachlan - 1968
19	Automorphisms of the lattice of recursively enumerable sets - Soare - 1974
14	Degrees of recursively enumerable sets which have no maximal supersets - Lachlan
13	Splitting properties and jump classes - Maass, Shore, et al. - 1981
12	The ∆ 0 3 -automorphism method and noninvariant classes of degrees - Harrington, Soare - 1996
12	d-simple sets, small sets, and degree classes - Lerman, Soare - 1980
11	On the orbit of hyperhypersimple sets - Maass - 1984
9	Characterization of recursively enumerable sets with supersets effectively isomorphic to all recursively enumerable sets - Maass - 1983
8	Recursive Boolean Algebras, in Handbook of Boolean Algebras - Remmel - 1990
7	There is no fat orbit - Downey, Harrington - 1996
7	Definability, automorphisms, and dynamic properties of computably enumerable sets - Harrington, Soare - 1996
7	The undecidability of the elementary theory of the lattice of recursively enumerable sets, Frege conference - Herrmann - 1984
5	Coding in the partial order of enumerable sets - Harrington, Nies - 1998
5	Automorphisms of the lattice of recursively enumerable sets and hyperhypersimple sets - Herrmann - 1986
4	Degrees of classes of recursively enumerable sets - Shoenfield
3	Notes on 3 theorems by Leo Harrington. Handwritten Notes - Cholak
3	The undecidability of the lattice of recursively enumerable sets. Handwritten Notes - Harrington - 1983
2	r-maximal major subsets - Lerman, Shore, et al. - 1978
1	n.d.]. Automorphisms of the computably enumerable sets: �1 1-completeness. In preparation - Soc - 1996