Reducibilities in two models for combinatory logic (Q3206935): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.2307/2273730 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2043285104 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumeration reducibility and partial degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3226265 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hyperenumeration reducibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5573961 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Category methods in recursion theory / rank
 
Normal rank

Latest revision as of 02:17, 13 June 2024

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
    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