Games in Recursion Theory and Continuity Properties of Capping Degrees

@inproceedings{Harrington1992GamesIR,
  title={Games in Recursion Theory and Continuity Properties of Capping Degrees},
  author={Leo Harrington and Robert I. Soare},
  year={1992}
}
  • Leo Harrington, Robert I. Soare
  • Published 1992
  • Mathematics
  • It is shown here that there are no maximal minimal pairs of recursively enumerable (r.e.) degrees. Combining this with a dual theorem by Ambos-Spies, Lachlan and Soare for r.e. degrees cupping to 0′ it follows that any open formula F(x, y) of two free variables in the language of the r.e. degrees, R, which holds for r.e. degrees a ≠ b, where a, b ≠ 0,0’, holds continuously in a neighborhood about a and b. This is the best possible continuity result for formulas in general, because it fails for… CONTINUE READING

    Create an AI-powered research feed to stay up to date with new papers like this posted to ArXiv

    Citations

    Publications citing this paper.
    SHOWING 1-10 OF 13 CITATIONS

    Contributions to degree structures.

    VIEW 13 EXCERPTS
    CITES BACKGROUND
    HIGHLY INFLUENCED

    Mathematical Logic

    VIEW 4 EXCERPTS
    CITES BACKGROUND
    HIGHLY INFLUENCED

    Highness, locally noncappability and nonboundings

    VIEW 1 EXCERPT

    On Lachlan’s major sub-degree problem

    VIEW 1 EXCERPT
    CITES BACKGROUND

    Prime models of computably enumerable degree

    On definable filters in computably enumerable degrees

    VIEW 1 EXCERPT
    CITES BACKGROUND