Reducibilities in two models for combinatory logic (Q3206935): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| 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 | |||
Revision as of 00:08, 20 March 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
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
