Towards characterizing the \(> \omega^2\)-fickle recursively enumerable Turing degrees (Q6119790)

From MaRDI portal
scientific article; zbMATH DE number 7806911
Language Label Description Also known as
English
Towards characterizing the \(> \omega^2\)-fickle recursively enumerable Turing degrees
scientific article; zbMATH DE number 7806911

    Statements

    Towards characterizing the \(> \omega^2\)-fickle recursively enumerable Turing degrees (English)
    0 references
    0 references
    0 references
    20 February 2024
    0 references
    0 references
    recursively enumerable
    0 references
    Turing degrees
    0 references
    fickleness
    0 references
    hierarchy
    0 references
    lattice
    0 references
    embedding
    0 references
    0 references