Reducibilities in two models for combinatory logic (Q3206935)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 3648689
Language Label Description Also known as
default for all languages
No label defined
    English
    Reducibilities in two models for combinatory logic
    scientific article; zbMATH DE number 3648689

      Statements

      Reducibilities in two models for combinatory logic (English)
      0 references
      0 references
      1979
      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

      Identifiers