The complexity of model-checking tail-recursive higher-order fixpoint logic (Q4989164)
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 model-checking tail-recursive higher-order fixpoint logic |
scientific article; zbMATH DE number 7350464
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of model-checking tail-recursive higher-order fixpoint logic |
scientific article; zbMATH DE number 7350464 |
Statements
The Complexity of Model-Checking Tail-Recursive Higher-Order Fixpoint Logic (English)
0 references
21 May 2021
0 references
0 references
0 references
0.9562565088272096
0 references
0.9083946347236632
0 references
0.8694915175437927
0 references
0.8534855246543884
0 references
0.815118670463562
0 references
