First-order linear logic without modalities is NEXPTIME-hard
type: Item
instance of: scholarly article
title: First-order linear logic without modalities is NEXPTIME-hard
zbMATH Open document ID: 0824.68023
DOI: 10.1016/0304-3975(94)00107-3
published in: Theoretical Computer Science
publication date: 1995-01-11T00:00:00Z
Mathematics Subject Classification ID: 68N17
Mathematics Subject Classification ID: 03B20
zbMATH DE Number: 710242
zbMATH Keywords: logic programming simulation
zbMATH Keywords: nondeterministic Turing machines
author: P. Lincoln
author: Andre Scedrov
describes a project that uses: Lolli
MaRDI profile type: Publication
full work available at URL: 0304-3975(94)00107-3
OpenAlex ID: W2080492358
cites work: Logic Programming with Focusing Proofs in Linear Logic
cites work: Q3357521
cites work: Linear logic
cites work: Q3862379
cites work: Decision problems for propositional linear logic
cites work: Linearizing intuitionistic implication
cites work: Constant-only multiplicative linear logic is NP-complete
cites work: Q4298260
cites work: Q4712651
cites work: Q4264720
cites work: Alternation and the computational complexity of logic programs
cites work: Classifying the computational complexity of problems
cites work: Q4495851
description: scientific article; zbMATH DE number 710242