First-order linear logic without modalities is NEXPTIME-hard (Q1342252)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | First-order linear logic without modalities is NEXPTIME-hard |
scientific article |
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
