Boone William W.. Partial results regarding word problems and recursively enumerable degrees of unsolvability. Bulletin of the American Mathematical Society, vol. 68 , pp. 616–623 [Book Review]

Journal of Symbolic Logic 28 (4):292-292 (1963)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2271316

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,674

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: William W. Boone, Partial Results Regarding Word Problems and Recursively Enumerable Degrees of Unsolvability. [REVIEW]Marian Boykan Pour-El - 1963 - Journal of Symbolic Logic 28 (4):292-292.
Partial Results Regarding Word Problems and Recursively Enumerable Degrees of Unsolvability.William W. Boone - 1963 - Journal of Symbolic Logic 28 (4):292-292.
Word Problems and Recursively Enumerable Degrees of Unsolvability. An Emendation.William W. Boone & Donald J. Collins - 1974 - Journal of Symbolic Logic 39 (1):184-185.
Mass problems and almost everywhere domination.Stephen G. Simpson - 2007 - Mathematical Logic Quarterly 53 (4):483-492.
The density of infima in the recursively enumerable degrees.Theodore A. Slaman - 1991 - Annals of Pure and Applied Logic 52 (1-2):155-179.
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.
Cooper S. B.. Degrees of unsolvability complementary between recursively enumerable degrees, Part I. Annals of mathematical logic, vol. 4 no. 1 , pp. 31–73. [REVIEW]Dick Epstein - 1975 - Journal of Symbolic Logic 40 (1):86-86.
The discontinuity of splitting in the recursively enumerable degrees.S. Barry Cooper & Xiaoding Yi - 1995 - Archive for Mathematical Logic 34 (4):247-256.
The Isolated D. R. E. Degrees are Dense in the R. E. Degrees.Geoffrey Laforte - 1996 - Mathematical Logic Quarterly 42 (1):83-103.
Complementation in the Turing degrees.Theodore A. Slaman & John R. Steel - 1989 - Journal of Symbolic Logic 54 (1):160-176.
Splittings of 0' into the Recursively Enumerable Degrees.Xiaoding Yi - 1996 - Mathematical Logic Quarterly 42 (1):249-269.
Post Emil L.. Recursively enumerable sets of positive integers and their decision problems. Bulletin of the American Mathematical Society, vol. 50 , pp. 284–316. [REVIEW]J. C. C. McKinsey - 1945 - Journal of Symbolic Logic 10 (1):18-19.
Degrees of Unsolvability Complementary between Recursively Enumerable Degrees, Part I.Dick Epstein - 1975 - Journal of Symbolic Logic 40 (1):86-86.
On a Class of Recursively Enumerable Sets.Farzad Didehvar - 1999 - Mathematical Logic Quarterly 45 (4):467-470.
The role of true finiteness in the admissible recursively enumerable degrees.Noam Greenberg - 2005 - Bulletin of Symbolic Logic 11 (3):398-410.

Analytics

Added to PP
2016-06-30

Downloads
20 (#784,799)

6 months
6 (#572,748)

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