The Undecidability of Second Order Multiplicative Linear Logic

Information and Computation

Volumn 125, Issue 1, 1996, Pages 46-51

  Lafont, Yves ^a   Scedrov, Andre ^b  

^a CNRS   (France)

^b UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

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

References (15)

1. Amiot, G. (1994), "Unification et logique du second ordre," Thèse de Doctorat, Université de Paris 7 (Denis Diderot).
2. Girard, J.-Y. (1987), Linear logic, Theoret. Comput. Sci. 50, 1-102.
3. Girard, J.-Y. (1995), Linear logic: Its syntax and semantics, in "Advances in Linear Logic" (J.-Y. Girard, Y. Lafont, and L. Regnier, Eds.), pp. 1-42, London Mathematical Society Lecture Note Series, Vol. 222, Cambridge Univ. Press, London/New York.
4. Kanovich, M. (1994), The complexity of Horn fragments of linear logic, Ann. Pure Appl. Logic 69, 195-241.
5. Kanovich, M. (1995), The direct simulation of Minsky machines in linear logic, in "Advances in Linear Logic" (J.-Y. Girard, Y. Lafont, and L. Regnier, Eds.), pp. 123-145, London Mathematical Society Lecture Note Series, Vol. 222, Cambridge Univ. Press, London/New York.
6. Lafont, Y. (1995), The undecidability of second order linear logic without exponentials, J. Symbolic Logic, to appear.
7. Lambek, J. (1961), How to program an infinite abacus, Canad. Math. Bull. 4, 295-302.
8. Lincoln, P., Mitchell, J., Scedrov, A., and Shankar, N. (1992), Decision problems for propositional linear logic, Ann. Pure Appl. Logic 56, 239-311.
9. Lincoln, P., and Scedrov, A. (1994), First order linear logic without modalities is NEXPTIME-hard, Theoret. Comput. Sci. 135, 139-154.
10. Lincoln, P., Scedrov, A., and Shankar, N. (1995), Decision problems for second order linear logic, in "Proceedings 10th Annual IEEE Symposium on Logic in Computer Science, San Diego, California," pp. 476-485.
11. Lincoln, P., and Shankar, N. (1994), Proof search in first-order linear logic and other cut-free sequent calculi, in "Proceedings 9th Annual IEEE Symposium on Logic in Computer Science, Paris," pp. 282-291.
12. Lincoln, P., and Winkler, T. (1994), Constant-only multiplicative linear logic is NP-complete, Theoret. Comput. Sci. 135, 155-169.
13. Minsky, M. (1961), Recursive unsolvability of Post's problem of 'tag' and other topics in the theory of Turing machines, Ann. of Math. 74, 437-455.
14. Scedrov, A. (1993), A brief guide to linear logic, in "Current Trends in Theoretical Computer Science" (G. Rozenberg and A. Salomaa, Eds.), pp. 377-394, World Scientific, Singapore.
15. Scedrov, A. (1995), Linear logic and computation: A survey, in "Proof and Computation, Proceedings Marktoberdorf Summer School 1993" (H. Schwichtenberg, Ed.), pp. 379-395, NATO Advanced Science Institutes, Series F, Springer-Verlag, Berlin/ New York.