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: 90,616

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

A Hierarchy For The Plus Cupping Turing Degrees.Angsheng Li & Yong Wang - 2003 - Journal of Symbolic Logic 68 (3):972-988.
A hierarchy for the plus cupping Turing degrees.Yong Wang & Angsheng Li - 2003 - Journal of Symbolic Logic 68 (3):972-988.
A minimal pair joining to a plus cupping Turing degree.Dengfeng Li & Angsheng Li - 2003 - Mathematical Logic Quarterly 49 (6):553-566.
The Structure of d.r.e. Degrees.Yong Liu - 2021 - Bulletin of Symbolic Logic 27 (2):218-219.
An almost-universal cupping degree.Jiang Liu & Guohua Wu - 2011 - Journal of Symbolic Logic 76 (4):1137-1152.
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.
The Cupping Theorem in R/M.Sui Yuefei & Zhang Zaiyue - 1999 - Journal of Symbolic Logic 64 (2):643-650.
The cupping theorem in r/m.Sui Yuefei & Zhang Zaiyue - 1999 - Journal of Symbolic Logic 64 (2):643-650.
Some Special Pairs of Σ2 e-Degrees.Seema Ahmad & Alistair H. Lachlan - 1998 - Mathematical Logic Quarterly 44 (4):431-449.

Analytics

Added to PP
2023-01-05

Downloads
2 (#1,635,221)

6 months
2 (#670,035)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Citations of this work

No citations found.

Add more citations