Low level nondefinability results: Domination and recursive enumeration

&
Journal of Symbolic Logic 78 (3):1005-1024 (2013)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2178/jsl.7803180

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,990

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

Review: Richard M. Friedberg, Three Theorems on Recursive Enumeration. I. Decomposition. II. Maximal Set. III. Enumeration Without Duplication. [REVIEW]Marian Boykan Pour-El - 1960 - Journal of Symbolic Logic 25 (2):165-166.
Enumeration of recursive sets.Yoshindo Suzuki - 1959 - Journal of Symbolic Logic 24 (4):311.
Nondefinability Results for Elliptic and Modular Functions.Raymond Mcculloch - forthcoming - Journal of Symbolic Logic:1-18.
Three Theorems on Recursive Enumeration. I. Decomposition. II. Maximal Set. III. Enumeration Without Duplication.Richard M. Friedberg - 1960 - Journal of Symbolic Logic 25 (2):165-166.
Review: Yoshindo Suzuki, Enumeration of Recursive Sets. [REVIEW]Ann M. Singleterry - 1968 - Journal of Symbolic Logic 33 (1):115-115.
Three theorems on recursive enumeration. I. decomposition. II. maximal set. III. enumeration without duplication.Richard M. Friedberg - 1958 - Journal of Symbolic Logic 23 (3):309-316.
Yoshindo Suzuki. Enumeration of recursive sets. The journal of symbolic logic, vol. 24 no. 4 , p. 311.Ann M. Singleterry - 1968 - Journal of Symbolic Logic 33 (1):115.
Review: Anil Nerode, Richard A. Shore, Logic for Applications. [REVIEW]Fahiem Bacchus - 1999 - Journal of Symbolic Logic 64 (1):404-405.
On the jump classes of noncuppable enumeration degrees.Charles M. Harris - 2011 - Journal of Symbolic Logic 76 (1):177 - 197.
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–. [REVIEW]Carl Jockusch - 1990 - Journal of Symbolic Logic 55 (1):358-360.

Analytics

Added to PP
2016-06-30

Downloads
8 (#1,336,069)

6 months
4 (#1,006,062)

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

The Degrees of Hyperimmune Sets.Webb Miller & D. A. Martin - 1968 - Mathematical Logic Quarterly 14 (7-12):159-166.
The Degrees of Hyperimmune Sets.Webb Miller & D. A. Martin - 1968 - Mathematical Logic Quarterly 14 (7‐12):159-166.
Direct and local definitions of the Turing jump.Richard A. Shore - 2007 - Journal of Mathematical Logic 7 (2):229-262.
A Hyperimmune Minimal Degree and an ANR 2-Minimal Degree.Mingzhong Cai - 2010 - Notre Dame Journal of Formal Logic 51 (4):443-455.
Dynamic notions of genericity and array noncomputability.Benjamin Schaeffer - 1998 - Annals of Pure and Applied Logic 95 (1-3):37-69.

Add more references