First-order linear logic without modalities is NEXPTIME-hard (Q1342252)
From MaRDI portal
!
WARNING
This is the item page for this Wikibase entity, intended for internal use and editing purposes.
Please use the normal view instead:
scientific article; zbMATH DE number 710242
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | First-order linear logic without modalities is NEXPTIME-hard |
scientific article; zbMATH DE number 710242 |
Statements
First-order linear logic without modalities is NEXPTIME-hard (English)
0 references
11 January 1995
0 references
logic programming simulation
0 references
nondeterministic Turing machines
0 references
0.7892550826072693
0 references
0.7818692922592163
0 references
0.7802693247795105
0 references
