Cupping and noncapping in the re weak truth table and Turing degrees

Archive for Mathematical Logic 25 (1):109-126 (1985)
  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: 101,369

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

Minimal weak truth table degrees and computably enumerable Turing degrees.R. G. Downey - 2020 - Providence, RI: American Mathematical Society. Edited by Keng Meng Ng & Reed Solomon.
Hypersimplicity and semicomputability in the weak truth table degrees.George Barmpalias - 2005 - Archive for Mathematical Logic 44 (8):1045-1065.
AMBOS-SPIES, K., LACHLAN, continuity of cupping to 0'.S. Shelah, C. Laflamme & B. Hart - 1993 - Annals of Pure and Applied Logic 64:293.
The weak truth table degrees of recursively enumerable sets.R. E. Ladner - 1975 - Annals of Mathematical Logic 8 (4):429.
On the definable ideal generated by the plus cupping c.e. degrees.Wei Wang & Decheng Ding - 2007 - Archive for Mathematical Logic 46 (3-4):321-346.
Weak Truth Table Degrees of Structures.David R. Belanger - 2015 - Notre Dame Journal of Formal Logic 56 (2):263-285.
The arithmetic and Turing degrees are not elementarily equivalent.Richard A. Shore - 1984 - Archive for Mathematical Logic 24 (1):137-139.

Analytics

Added to PP
2013-10-30

Downloads
16 (#1,199,504)

6 months
16 (#193,357)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Add more citations

References found in this work

No references found.

Add more references