Σn sets which are Δn-incomparable

Journal of Symbolic Logic 39 (2):295 - 304 (1974)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2272642

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,597

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

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.
Analytic sets having incomparable Kleene degrees.Galen Weitkamp - 1982 - Journal of Symbolic Logic 47 (4):860-868.
Two Recursively Enumerable Sets of Incomparable Degrees of Unsolvability.R. M. Friedberg - 1958 - Journal of Symbolic Logic 23 (2):225-226.
Richard Montague. Theories incomparable with respect to relative interpretability. The journal of symbolic logic, vol. 27 no. 2 , pp. 195–211.S. Feferman - 1971 - Journal of Symbolic Logic 36 (4):688.
Non Σn axiomatizable almost strongly minimal theories.David Marker - 1989 - Journal of Symbolic Logic 54 (3):921 - 927.
Anil Nerode and Richard A. Shore. Logic for applications. Texts and monographs in computer science. Springer-Verlag, New York, Berlin, Heidelberg, etc., 1993, xvii + 365 pp. [REVIEW]Fahiem Bacchus - 1999 - Journal of Symbolic Logic 64 (1):404-405.
Friedberg R. M.. Two recursively enumerable sets of incomparable degrees of unsolvability . Proceedings of the National Academy of Sciences of the United States of America, vol. 43 , pp. 236–238. [REVIEW]Hartley Rogers - 1958 - Journal of Symbolic Logic 23 (2):225-226.
The logic of arithmetical hierarchy.Giorgie Dzhaparidze - 1994 - Annals of Pure and Applied Logic 66 (2):89-112.
Anil Nerode & Richard A. Shore, Logic for Applications, Springer-Verlag, 1993. [REVIEW]Erkan Tin & Varol Akman - 1995 - ACM SIGACT News 26 (1):20-22.
Computational randomness and lowness.Sebastiaan Terwijn & Domenico Zambella - 2001 - Journal of Symbolic Logic 66 (3):1199-1205.

Analytics

Added to PP
2009-01-28

Downloads
258 (#103,980)

6 months
16 (#192,315)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Inadmissibility, tame R.E. sets and the admissible collapse.Wolfgang Maass - 1978 - Annals of Mathematical Logic 13 (2):149-170.
The recursively enumerable alpha-degrees are dense.Richard A. Shore - 1976 - Annals of Mathematical Logic 9 (1/2):123.

Add more citations

References found in this work

Theory of Recursive Functions and Effective Computability.Hartley Rogers - 1971 - Journal of Symbolic Logic 36 (1):141-146.
The α-finite injury method.G. E. Sacks & S. G. Simpson - 1972 - Annals of Mathematical Logic 4 (4):343-367.
The fine structure of the constructible hierarchy.R. Björn Jensen - 1972 - Annals of Mathematical Logic 4 (3):229.
Minimal α-degrees.Richard A. Shore - 1972 - Annals of Mathematical Logic 4 (4):393-414.

Add more references