Logic in Computer Science (LICS 1995)

Paper: Decidability of Linear Affine Logic (at LICS 1995)

Authors: A.P. Kopylov

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''.

BibTeX

  @InProceedings{Kopylov-DecidabilityofLinea,
    author = 	 {A.P. Kopylov},
    title = 	 {Decidability of Linear Affine Logic},
    booktitle =  {Proceedings of the Tenth Annual IEEE Symp. on Logic in Computer Science, {LICS} 1995},
    year =	 1995,
    editor =	 {Dexter Kozen},
    month =	 {June}, 
    pages =      {496-504},
    location =   {San Diego, CA, USA}, 
    publisher =	 {IEEE Computer Society Press}
  }