Phase semantics for light linear logic

Theoretical Computer Science

Volumn 294, Issue 3, 2003, Pages 525-549

  Kanovich, Max I ^a   Okada, Mitsuhiro ^b   Scedrov, Andre ^c  

^a RUSSIAN STATE UNIVERSITY FOR THE HUMANITIES   (Russian Federation)

^b KEIO UNIVERSITY   (Japan)

^c UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; POLYNOMIALS; SEMANTICS;

LOGICAL SYSTEMS;

FORMAL LOGIC;

EID: 0037452393     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(01)00177-3     Document Type: Conference Paper

References (17)

1. Danos V., Joinet J.-B., Schellinx H. The structure of exponentials: uncovering the dynamics of linear logic proofs. Gottlob G., Leitsch A., Mundici D. Proc. 3rd Kurt Gödel Colloquium on Computational Logic and Proof Theory, Lecture Notes in Computer Science. Vol. 713:1993;159-171 Springer, Berlin.
2. Girard J.-Y. Une extension de l'interprétation de Gödel a l'analyse, et son application a l'élimination des coupures dans l'analyse et la théorie des types. Fenstad J.E. Proc. 2nd Scandinavian Logic Symposium. 1971;63-92 North-Holland, Amsterdam.
3. Girard J.-Y. Linear logic. Theoret. Comput. Sci. 50:1987;1-102.
4. Girard J.-Y., Lafont Y., Taylor P. Proofs and Types, Cambridge Tracts in Theoretical Computer Science. Vol. 7:1988;Cambridge University Press, Cambridge.
5. Girard J.-Y. Light linear logic. Inform. Comput. 14:1998;175-204.
6. Girard J.-Y., Scedrov A., Scott P.J. Bounded linear logic: a modular approach to polynomial time computability. Theoret. Comp. Sci. 97:1992;1-66.
7. M.I. Kanovich, T. Ito, Temporal linear logic specifications for concurrent processes, in: Proc. 12th Ann. IEEE Symp. on Logic in Computer Science, Warsaw, Poland, 1997.
8. M.I. Kanovich, M. Okada, A. Scedrov, Phase semantics for light linear logic: extended abstract, in: Proc. 13th Conf. on the Mathematical Foundations of Programming Semantics, Pittsburgh, Pennsylvania, USA, 1997, Electronic Notes in Theoretical Computer Science. http://www1.elsevier.nl/mcs/tcs/pc/Menu.html.
9. Lafont Y. The undecidability of second order linear logic without exponentials. J. Symbolic Logic. 61:1996;541-548.
10. Lafont Y., Scedrov A. The undecidability of second order multiplicative linear logic. Inform. Comput. 125:1996;46-51.
11. Martini S., Masini A. On the fine structure of the exponential rule. Girard J.-Y., Lafont Y., Regnier L. Advances in Linear Logic, London Mathematical Society Lecture Notes. Vol. 222:1995;197-210 Cambridge University Press, Cambridge.
12. M. Okada, Phase semantics for higher order completeness, cut-elimination and normalization proofs (extended abstract), in: J.-Y. Girard, M. Okada, A. Scedrov, (Eds.), ENTCS (Electronic Notes in Theoretical Computer Science), Vol. 3, A Special Issue on Linear Logic 96, Tokyo Meeting. ENTCS, Elsevier, Amsterdam 1996.
13. Okada M. Phase semantic cut-elimination and normalization proofs of first- and higher-order linear logic. Theoret. Comput. Sci. 227:1999;333-396.
14. Okada M. A uniform semantic proof for cut-elimination and completeness of various first and higher order logics. Theoret. Comput. Sci. 281:2002;471-498.
15. Okada M., Terui K. The finite model property for various fragments of intuitionistic linear logic. J. Symbolic Logic. 64:1999;790-802.
16. A. Pnueli, The temporal logic of programs, in: Proc. 18th Ann. Symp. on the Foundations of Computer Science, 1977, pp. 46-57.
17. K. Terui, Light affine lambda calculus and polytime strong normalization, in: Proc. 16th Ann. IEEE Conference on Logic in Computer Science, 2001, pp. 209-220.