Decidability of linear affine logic

Information and Computation

Volumn 164, Issue 1, 2001, Pages 173-198

  Kopylov, A P ^a  

^a MOSCOW STATE UNIVERSITY   (Russian Federation)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; COMPUTER SCIENCE; PETRI NETS; THEOREM PROVING;

LINEAR LOGIC;

COMPUTABILITY AND DECIDABILITY;

EID: 0035835295     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1006/inco.1999.2834     Document Type: Article

References (6)

1. Girard, J.-Y. (1987), Linear logic, Theorem. Comput. Sci. 50, 1-102.
2. Kanovich, M. I. (1992), Horn programming in linear logic is NP-complete, in "Proc. 7th Annual IEEE Symposium on Logic in Computer Science, Santa Cruz, June 1992," pp. 200-210.
3. Kanovich, M. I. (1994), Petri nets, Horn programs, linear logic, and vector games, in "Proceedings of the International Symposium Theoretical Aspects of Computer Software, TACS'94, Sendai, Japan" (M. Hagiya and J. Mitchell, Eds.), Lecture Notes in Computer Science, Vol. 789, pp. 642-666.
4. Kanovich, M. I. (January 1994), Simulating Linear Logic in 1-One Linear Logic, CNRS, Laboratoire de Mathématiques Discrètes Prétirage 94-02, Available by anonymous ftp from host lmd.univ-mrs.fr and the file pub/kanovich/unit-only.dvi.
5. Lincoln, P., Mitchell, J., Scedrov, A., and Shankar, N. (1990), Decision problems for propositional linear logic, in "Proc. 31st IEEE Symp. on Foundations of Computer Science." pp. 662-671.
6. Troelstra, A. S. (1992), Lectures on linear logic, in "CSLI Lecture Notes," Vol. 29.