The recursively enumerable degrees

The recursively enumerable degrees (1996)

Cached

Download Links

by Richard A. Shore

Venue:	in Handbook of Computability Theory, Studies in Logic and the Foundations of Mathematics 140
Citations:	7 - 5 self

BibTeX

@INPROCEEDINGS{Shore96therecursively,
    author = {Richard A. Shore},
    title = { The recursively enumerable degrees},
    booktitle = {in Handbook of Computability Theory, Studies in Logic and the Foundations of Mathematics 140},
    year = {1996},
    pages = {392--404},
    publisher = {North-Holland}
}

Bookmark

OpenURL

Abstract

Citations

713	Theory of Recursive Functions and Effective Computability - Rogers - 1967
411	Recursively Enumerable Sets and Degrees - Soare - 1987
106	Recursively enumerable sets of positive integers and their decision problems - Post - 1944
97	Systems of Logic Based on Ordinals - Turing - 1939
66	Degrees of Unsolvability - Lerman - 1983
58	Degrees of unsolvability - Sacks - 1963
44	Two recursively enumerable sets of incomparable degrees of unsolvability - Friedberg - 1957
40	On the degrees less than 0 - Sacks
36	Lower bounds for pairs of recursively enumerable degrees - Lachlan - 1966
32	Degrees of Unsolvability - Shoenfield - 1971
31	The recursively enumerable degrees are dense - Sacks - 1964
30	On the unsolvability of the problem of reducibility in the theory of algorithms - Muchnik - 1956
30	1998], Interpretability and definability in the recursively enumerable degrees - Nies, Shore, et al.
27	Pseudo-jump operators II: transfinite iterations, hierarchies and minimal covers - Shore - 1984
27	A recursively enumerable degree which will not split over all lesser ones - Lachlan
26	Interpolation and embedding in the recursively enumerable degrees - Robinson - 1971
25	Embedding nondistributive lattices in the recursively enumerable degrees - Lachlan - 1970
23	Recursive enumerability and the jump operator - Sacks - 1963
20	Post’s program and incomplete recursively enumerable sets - Harrington, Soare - 1991
16	Decidability in degree structures - Slaman, Woodin
15	Recursively enumerable generic sets - Maass - 1982
14	Decidability and invariant classes for degree structures - Lerman, Shore - 1988
14	Working below a high recursively enumerable degree - Shore, Slaman
13	Lattice nonembeddings and initial segments of the recursively enumerable degrees - Downey - 1990
13	A noninversion theorem for the jump operator - Shore - 1988
12	Lattice embeddings into the recursively enumerable degrees - Ambos-Spies, Lerman - 1986
12	Minimal pairs and high recursively enumerable degrees - Cooper - 1974
12	Some problems of definability in recursive function theory - Rogers - 1965
12	Finitely generated codings and the degrees r.e. in a degree d - Shore - 1982
12	Three theorems on the degrees of recursively enumerable sets - Yates - 1965
11	recursively enumerable degrees and the anti-cupping property - Miller, High - 1981
11	The density of infima in the recursively enumerable degrees - Slaman - 1991
10	1982], The undecidability of the recursively enumerable degrees (research announcement - Harrington, Shelah
10	Pseudo-jump operators. I: the r.e - Jockusch, Shore - 1983
10	1984], The Elementary Theory of the Recursively Enumerable Degrees is not ℵ0-categorical - Lerman, Shore, et al.
9	The density of the nonbranching degrees - Fejer - 1983
9	1954] The upper semi-lattice of degrees of recursive unsolvability - Kleene, Post
9	A finite lattice without critical triple that cannot be embedded into the enumerable Turing degrees - Lempp, Lerman - 1997
9	Application of model theory to degrees of unsolvability - Shoenfield - 1965
9	On the ∀∃-sentences of α-recursion theory - Shore - 1978
7	1995], Degree theoretic definitions of the low 2 recursively enumerable sets - Downey, Shore - 1995
7	1990], Working below a low2 recursively enumerable degree, Archive for - Shore, Slaman
6	The jump is definable in the structure of the degrees of unsolvability (research announcement - Cooper - 1990
6	Beyond Godel's theorem: the failure to capture information content - Cooper - 1997
6	1966], The impossibility of finding relative complements for recursively enumerable degrees - Lachlan
6	The elementary theory of recursively enumerable sets - Lachlan - 1968
6	Decomposition of recursively enumerable degrees - Lachlan - 1980
6	A minimal pair of recursively enumerable degrees, J. Symbolic Logic 31 - Yates - 1966
6	On the 89-sentences of ff-recursion theory, in Generalized Recursion Theory - Shore
5	Lattice nonembeddings and intervals in the recursively enumerable degrees - Cholak, Downey - 1993