Richard A. Shore. Determining automorphisms of the recursively enumerable sets. Proceedings of the American Mathematical Society, vol. 65 , pp. 318– 325. - Richard A. Shore. The homogeneity conjecture. Proceedings of the National Academy of Sciences of the United States of America, vol. 76 , pp. 4218– 4219. - Richard A. Shore. On homogeneity and definability in the first-order theory of the Turing degrees. The journal of symbolic logic, vol. 47 , pp. 8– 16. - Richard A. Shore. The arithmetic and Turing degrees are not elementarily equivalent. Archiv für mathematische Logik und Grundlagenforschung, vol. 24 , pp. 137– 139. - Richard A. Shore. The structure of the degrees of unsolvabitity. Recursion theory, edited by Anil Nerode and Richard A. Shore, Proceedings of symposia in pure mathematics, vol. 42, American Mathematical Society, Providence1985, pp. 33– 51. - Theodore A. Slaman and W. Hugh Woodin. Definability in the Turing degrees. Illinois journal of mathematics, vol. 30 , pp. 320– [Book Review]

Journal of Symbolic Logic 55 (1):358-360 (1990)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2274995

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,386

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

On homogeneity and definability in the first-order theory of the Turing degrees.Richard A. Shore - 1982 - Journal of Symbolic Logic 47 (1):8-16.
The arithmetic and Turing degrees are not elementarily equivalent.Richard A. Shore - 1984 - Archive for Mathematical Logic 24 (1):137-139.
Definability In The Recursively Enumerable Degrees.Andr\'E. Nies, Richard Shore & Theodore Slaman - 1996 - Bulletin of Symbolic Logic 2 (3):392-404.
Definability in the recursively enumerable degrees.André Nies, Richard A. Shore & Theodore A. Slaman - 1996 - Bulletin of Symbolic Logic 2 (4):392-404.
Undecidability and 1-types in the recursively enumerable degrees.Klaus Ambos-Spies & Richard A. Shore - 1993 - Annals of Pure and Applied Logic 63 (1):3-37.
The theory of the metarecursively enumerable degrees.Noam Greenberg, Richard A. Shore & Theodore A. Slaman - 2006 - Journal of Mathematical Logic 6 (1):49-68.
Decomposition and infima in the computably enumerable degrees.Rodney G. Downey, Geoffrey L. Laforte & Richard A. Shore - 2003 - Journal of Symbolic Logic 68 (2):551-579.
Determining Automorphisms of the Recursively Enumerable Sets.Richard A. Shore & Anil Nerode - 1990 - Journal of Symbolic Logic 55 (1):358-360.
The Turing degrees below generics and randoms.Richard A. Shore - 2014 - Journal of Symbolic Logic 79 (1):171-178.
Interpreting true arithmetic in the theory of the r.e. truth table degrees.André Nies & Richard A. Shore - 1995 - Annals of Pure and Applied Logic 75 (3):269-311.
The n-r.E. Degrees: Undecidability and σ1 substructures.Mingzhong Cai, Richard A. Shore & Theodore A. Slaman - 2012 - Journal of Mathematical Logic 12 (1):1250005-.
On the Jumps of the Degrees Below a Recursively Enumerable Degree.David R. Belanger & Richard A. Shore - 2018 - Notre Dame Journal of Formal Logic 59 (1):91-107.
Reducibility orderings: Theories, definability and automorphisms.Anil Nerode & Richard A. Shore - 1980 - Annals of Mathematical Logic 18 (1):61-89.
The recursively enumerable alpha-degrees are dense.Richard A. Shore - 1976 - Annals of Mathematical Logic 9 (1/2):123.
Some More Minimal Pairs of α‐Recursively Enumerable Degrees.Richard A. Shore - 1978 - Mathematical Logic Quarterly 24 (25‐30):409-418.

Analytics

Added to PP
2016-06-30

Downloads
28 (#555,203)

6 months
6 (#504,917)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references