The Diagonal Problem for Higher-Order Recursion Schemes is Decidable (Q4635865): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 16:17, 7 February 2024
scientific article; zbMATH DE number 6863479
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The Diagonal Problem for Higher-Order Recursion Schemes is Decidable |
scientific article; zbMATH DE number 6863479 |
Statements
The Diagonal Problem for Higher-Order Recursion Schemes is Decidable (English)
0 references
23 April 2018
0 references
diagonal problem
0 references
downward closure
0 references
higher-order OI grammars
0 references
higher-order recursion schemes
0 references
separability problem
0 references
