Recursively Enumerable Degrees and the Conjugacy Problem

Journal of Symbolic Logic 35 (3):477-477 (1970)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2270748

Links

PhilArchive



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

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

Recursively Enumerable Degrees and the Conjugacy Problem.Donald J. Collins - 1971 - Journal of Symbolic Logic 36 (3):540-540.
Review: Donald J. Collins, Recursively Enumerable Degrees and the Conjugacy Problem. [REVIEW]C. R. J. Clapham - 1971 - Journal of Symbolic Logic 36 (3):540-540.
Review: Donald J. Collins, Recursively Enumerable Degrees and the Conjugacy Problem. [REVIEW]Charles F. Miller - 1970 - Journal of Symbolic Logic 35 (3):477-477.
Collins Donald J.. Recursively enumerable degrees and the conjugacy problem. Acta mathematica, vol. 122 , pp. 115–160.C. R. J. Clapham - 1971 - Journal of Symbolic Logic 36 (3):540.
The density of infima in the recursively enumerable degrees.Theodore A. Slaman - 1991 - Annals of Pure and Applied Logic 52 (1-2):155-179.
Complementation in the Turing degrees.Theodore A. Slaman & John R. Steel - 1989 - Journal of Symbolic Logic 54 (1):160-176.
The discontinuity of splitting in the recursively enumerable degrees.S. Barry Cooper & Xiaoding Yi - 1995 - Archive for Mathematical Logic 34 (4):247-256.
Incomparable prime ideals of recursively enumerable degrees.William C. Calhoun - 1993 - Annals of Pure and Applied Logic 63 (1):39-56.
On recursive enumerability with finite repetitions.Stephan Wehner - 1999 - Journal of Symbolic Logic 64 (3):927-945.
On Recursive Enumerability with Finite Repetitions.Stephan Wehner - 1999 - Journal of Symbolic Logic 64 (3):927-945.
The Isolated D. R. E. Degrees are Dense in the R. E. Degrees.Geoffrey Laforte - 1996 - Mathematical Logic Quarterly 42 (1):83-103.
Splittings of 0' into the Recursively Enumerable Degrees.Xiaoding Yi - 1996 - Mathematical Logic Quarterly 42 (1):249-269.
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 role of true finiteness in the admissible recursively enumerable degrees.Noam Greenberg - 2005 - Bulletin of Symbolic Logic 11 (3):398-410.
The continuity of cupping to 0'.Klaus Ambos-Spies, Alistair H. Lachlan & Robert I. Soare - 1993 - Annals of Pure and Applied Logic 64 (3):195-209.

Analytics

Added to PP
2017-02-21

Downloads
2 (#1,750,398)

6 months
2 (#1,136,865)

Historical graph of downloads

Sorry, there are not enough data points to plot this chart.
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