The $\Pi _3$-theory of the computably enumerable Turing degrees is undecidable (Q4211072)

From MaRDI portal
Revision as of 20:56, 26 October 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 1198494
Language Label Description Also known as
English
The $\Pi _3$-theory of the computably enumerable Turing degrees is undecidable
scientific article; zbMATH DE number 1198494

    Statements

    The $\Pi _3$-theory of the computably enumerable Turing degrees is undecidable (English)
    0 references
    0 references
    0 references
    0 references
    10 September 1998
    0 references
    computably enumerable degrees
    0 references
    recursively enumerable degrees
    0 references
    \(\Pi_3\)-theory
    0 references
    fragment of first-order theory
    0 references
    undecidability
    0 references
    Turing degrees
    0 references

    Identifiers