Undecidability and 1-Types in the Recursively Enumerable Degrees - researchr publication related

researchr

You are not signed in
Sign in
Sign up

Klaus Ambos-Spies, Richard A. Shore. Undecidability and 1-Types in the Recursively Enumerable Degrees. Annals of Pure and Applied Logic, 63(1):3-37, 1993.

The following publications are possibly variants of this publication:

Undecidability and 1-types in intervals of the computably enumerable degreesKlaus Ambos-Spies, Denis R. Hirschfeldt, Richard A. Shore. APAL, 106(1-3):1-47, 2000.

The Theory of the Recursively Enumerable Weak Truth-Table Degrees Is UndecidabilityKlaus Ambos-Spies, André Nies, Richard A. Shore. JSYML, 57(3):864-874, 1992.

The Recursively Enumerable DegreesRichard A. Shore. In Edward R. Griffor, editor, Handbook of Computability Theory. Volume 140 of Studies in Logic and the Foundations of Mathematics, pages 169-197, North-Holland, 1999. [doi]

2 recursively enumerably degreeRichard A. Shore, Theodore A. Slaman. AML, 29(3):201-211, 1990. [doi]

Definability in the recursively enumerable degreesAndré Nies, Richard A. Shore, Theodore A. Slaman. bsl, 2(4):392-404, 1996. [doi]

runs on WebDSL