The complexity of completions in partial combinatory algebra (Q6635151)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The complexity of completions in partial combinatory algebra |
scientific article; zbMATH DE number 7940940
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of completions in partial combinatory algebra |
scientific article; zbMATH DE number 7940940 |
Statements
The complexity of completions in partial combinatory algebra (English)
0 references
9 November 2024
0 references
partial combinatory algebra
0 references
Turing degrees
0 references
Peano arithmetic
0 references
