The diagonal problem for higher-order recursion schemes is decidable (Q4635865)
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 diagonal problem for higher-order recursion schemes is decidable |
scientific article; zbMATH DE number 6863479
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.8974152207374573
0 references
0.7788002490997314
0 references
0.7695140242576599
0 references
0.7648160457611084
0 references
