that B is Turing reducible to A and write B≤ T A. We say that B≡ T A if B≤ T A and A≤ T B.≡ T is an equivalence relation, and≤ T induces a par-tial ordering on the corresponding equivalence classes; the poset obtained in this way is called the degrees of unsolvability, and elements of this poset are called degrees [Book Review]

Bulletin of Symbolic Logic 1 (2) (1995)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 100,290

External links

  • This entry has no external links. Add one.
Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

On the complexity-relativized strong reducibilities.Jari Talja - 1982 - Bulletin of the Section of Logic 11 (1-2):77-78.
Recursive inseparability for residual Bounds of finite algebras.Ralph Mckenzie - 2000 - Journal of Symbolic Logic 65 (4):1863-1880.
Finding the limit of incompleteness I.Yong Cheng - 2020 - Bulletin of Symbolic Logic 26 (3-4):268-286.
Relative enumerability and 1-genericity.Wei Wang - 2011 - Journal of Symbolic Logic 76 (3):897 - 913.
Complementary Sentential Logics.Achille C. Varzi - 1990 - Bulletin of the Section of Logic 19 (4):112-116.
Partitioning subsets of stable models.Timothy Bays - 2001 - Journal of Symbolic Logic 66 (4):1899-1908.
On the number of nonisomorphic models of size |t|.Ambar Chowdhury - 1994 - Journal of Symbolic Logic 59 (1):41 - 59.
A general framework for priority arguments.Steffen Lempp & Manuel Lerman - 1995 - Bulletin of Symbolic Logic 1 (2):189-201.

Analytics

Added to PP
2014-01-21

Downloads
26 (#841,108)

6 months
26 (#122,100)

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