Decidability of Linear Affine Logic

Authors:
A. P. Kopylov
Affiliations:
-
Venue:
LICS '95 Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science
Year:
1995

Citing 0
Cited 10

On Implicit Meanings

Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part II
Finite Models and Full Completeness

Proceedings of the 14th Annual Conference of the EACSL on Computer Science Logic
The Expressive Power of Horn Monadic Linear Logic

CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
An effective fixpoint semantics for linear logic programs

Theory and Practice of Logic Programming
Model checking linear logic specifications

Theory and Practice of Logic Programming
Phase semantics and decidability of elementary affine logic

Theoretical Computer Science - Logic, semantics and theory of programming
Linear and affine logics with temporal, spatial and epistemic operators

Theoretical Computer Science
Linear Exponentials as Resource Operators: A Decidable First-order Linear Logic with Bounded Exponentials

JELIA '08 Proceedings of the 11th European conference on Logics in Artificial Intelligence
Plans, Actions and Dialogues Using Linear Logic

Journal of Logic, Language and Information
Modelling Multilateral Negotiation in Linear Logic

Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

The propositional Linear Logic is known to be undecidable. In the current paper we prove that the full propositional Linear Affine Logic containing all the multiplicatives, additives, exponentials, and constants is decidable. The proof is based on a reduction of Linear Affine Logic to sequents of specific ``normal forms'', and on a generalization of Kanovich computational interpretation of Linear Logic adapted to these ``normal forms''.