Reducibilities in two models for combinatory logic (Q3206935)

From MaRDI portal
Revision as of 03:17, 13 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Reducibilities in two models for combinatory logic
scientific article

    Statements

    Reducibilities in two models for combinatory logic (English)
    0 references
    0 references
    0 references
    1979
    0 references
    0 references
    combinatory logic
    0 references
    graph model
    0 references
    generalizations of enumeration and Turing reducibilities
    0 references
    generalizations of hyperenumeration and hyperarithmetical reducibilities
    0 references
    0 references