Concepedia

Some Special Pairs of Σ<sub>2</sub> e‐Degrees

Seema Ahmad, A. H. Lachlan

Mathematical logic quarterly · 1998 · 19 citations · 9 references

DOI

Concepts

Abstract

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 .

References

9

Theory of Recursive Functions and Effective Computability.

Solomon Feferman, Hartley Rogers · American Mathematical Monthly · 1969 · 2.8K citations

, , +14

Theory of Recursive Functions and Effective Computability

D. C. Cooper · The Computer Journal · 1969 · 2.6K citations · Full text

, , +14

Recursively enumerable sets and degrees

Robert I. Soare · Bulletin of the American Mathematical Society · 1978 · 1.6K citations · Full text

, , +15

Partial degrees and the density problem. Part 2: The enumeration degrees of the <i>Σ</i><sub>2</sub> sets are dense

S. Barry Cooper · Journal of Symbolic Logic · 1984 · 70 citations

, , +12

Jumps of quasi-minimal enumeration degrees

Kevin McEvoy · Journal of Symbolic Logic · 1985 · 65 citations

, , +12