Some Special Pairs of Σ2 e-Degrees

&
Mathematical Logic Quarterly 44 (4):431-449 (1998)
  Copy   BIBTEX

Abstract

It is shown that there are incomparable Σ2 e-degrees a, b such that every e-degree strictly less than a is also less than b.

Categories

Keywords

Reprint years

DOI

10.1002/malq.19980440402

Other Versions

reprint Lachlan, Alistair H.; Ahmad, Seema (2006) "Some Special Pairs of Σ2 e‐Degrees". Mathematical Logic Quarterly 44(4):431-449

Links

PhilArchive

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

On the Symmetric Enumeration Degrees.Charles M. Harris - 2007 - Notre Dame Journal of Formal Logic 48 (2):175-204.
Limit lemmas and jump inversion in the enumeration degrees.Evan J. Griffiths - 2003 - Archive for Mathematical Logic 42 (6):553-562.
Cupping and definability in the local structure of the enumeration degrees.Hristo Ganchev & Mariya I. Soskova - 2012 - Journal of Symbolic Logic 77 (1):133-158.
The degrees of conditional problems.Su Gao - 1994 - Journal of Symbolic Logic 59 (1):166-181.
Goodness in the enumeration and singleton degrees.Charles M. Harris - 2010 - Archive for Mathematical Logic 49 (6):673-691.
Elementary Differences between the (2p)-C. E. and the (2p + 1)-C. E. Enumeration Degrees.I. Sh Kalimullin - 2007 - Journal of Symbolic Logic 72 (1):277 - 284.
The Π₃-Theory of the [image] -Enumeration Degrees Is Undecidable.Thomas F. Kent - 2006 - Journal of Symbolic Logic 71 (4):1284 - 1302.
The limitations of cupping in the local structure of the enumeration degrees.Mariya I. Soskova - 2010 - Archive for Mathematical Logic 49 (2):169-193.
Randomness, Lowness and Degrees.George Barmpalias, Andrew E. M. Lewis & Mariya Soskova - 2008 - Journal of Symbolic Logic 73 (2):559 - 577.

Analytics

Added to PP
2014-01-16

Downloads
147 (#295,672)

6 months
73 (#136,857)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

The singleton degrees of the Σ 2 0 sets are not dense.Thomas F. Kent, Keng Meng Ng & Andrea Sorbi - 2025 - Annals of Pure and Applied Logic 176 (9):103616.
Bounding Nonsplitting Enumeration Degrees.Thomas F. Kent & Andrea Sorbi - 2007 - Journal of Symbolic Logic 72 (4):1405 - 1417.
On Cupping and Ahmad Pairs.Iskander Sh Kalimullin, Steffen Lempp, N. G. Keng & Mars M. Yamaleev - 2024 - Journal of Symbolic Logic 89 (3):1358-1369.

View all 9 citations / Add more citations

References found in this work

Theory of Recursive Functions and Effective Computability.Hartley Rogers - 1971 - Journal of Symbolic Logic 36 (1):141-146.

Add more references