Elsevier

Information and Computation

Volume 164, Issue 1, 10 January 2001, Pages 173-198
Information and Computation

Regular Article
Decidability of Linear Affine Logic

https://doi.org/10.1006/inco.1999.2834Get rights and content
Under an Elsevier user license
open archive

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.

Cited by (0)

This article was originally part of the LICS 1995 special issue, which appeared in Information and Computation, Vol. 157, 2000.

1

The research described on this publication was made possible in part by grant NFQ000 from the International Science Foundation.