On Cupping and Ahmad Pairs

Journal of Symbolic Logic:1-12 (forthcoming)
  Copy   BIBTEX

Abstract

Working toward showing the decidability of the $\forall \exists $ -theory of the ${\Sigma ^0_2}$ -enumeration degrees, we prove that no so-called Ahmad pair of ${\Sigma ^0_2}$ -enumeration degrees can join to ${\mathbf 0}_e'$.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,296

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Structural Properties and $\Sigma^0_2$ Enumeration Degrees.Andre Nies & Andrea Sorbi - 2000 - Journal of Symbolic Logic 65 (1):285-292.
Noncappable enumeration degrees below 0'e. [REVIEW]S. Barry Cooper & Andrea Sorbi - 1996 - Journal of Symbolic Logic 61 (4):1347 - 1363.
The $\Pi^0_2$ Enumeration Degrees are Not Dense.William Calhoun & Theodore Slaman - 1996 - Journal of Symbolic Logic 61 (3):1364-1379.

Analytics

Added to PP
2023-01-05

Downloads
9 (#1,281,906)

6 months
7 (#491,177)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Citations of this work

No citations found.

Add more citations