Recursively enumerable sets of positive integers and their decision problems (Q5845382)

From MaRDI portal
Revision as of 08:58, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 3106575
Language Label Description Also known as
English
Recursively enumerable sets of positive integers and their decision problems
scientific article; zbMATH DE number 3106575

    Statements

    Recursively enumerable sets of positive integers and their decision problems (English)
    0 references
    0 references
    1944
    0 references
    Recursive sets
    0 references
    recursively enumerable sets
    0 references
    Gödel's theorem
    0 references
    complete set \(K\)
    0 references
    creative sets
    0 references
    one-one reducibility to \(K\)
    0 references
    many-one reducibility
    0 references
    sim
    0 references
    non-reducibility of creative sets to simple sets by bounded truth-tables
    0 references
    counter-example for unbounded truth-tables
    0 references
    hyper-simple sets
    0 references
    non-reducibility of creative sets to hyper-simple sets by truth-tables unrestricted
    0 references

    Identifiers