Phase semantics for light linear logic (extended abstract)

Electronic Notes in Theoretical Computer Science

Volumn 6, Issue , 1997, Pages 221-234

  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; COMPUTATION THEORY; COMPUTATIONAL COMPLEXITY; DIFFERENTIATION (CALCULUS); LINEAR PROGRAMMING; LOGIC PROGRAMMING; MATHEMATICAL MODELS; POLYNOMIALS; SET THEORY; THEOREM PROVING;

LIGHT LINEAR LOGIC; PHASE SEMANTICS; PHASE SPACES; POLYNOMIAL-TIME COMPUTATION;

SEMANTICS;

EID: 18944363457     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(05)80159-8     Document Type: Conference Paper

References (12)

1. Jean-Yves Girard. Light linear logic. Manuscript. 1995;. Available by anonymous ftp from lmd.univ-mrs.fr as /pub/girard/LLL.ps.Z
2. Jean-Yves Girard, Yves Lafont, Taylor P. Proofs and Types. Cambridge Tracts in Theoretical Computer Science 7. 1988;Cambridge University Press
3. Jean-Yves Girard. Linear logic. Theoretical Computer Science. 50:1987;1-102
4. Girard Jean-Yves, Scedrov Andre, Scott Philip J. Bounded linear logic: A modular approach to polynomial time computability. Theoretical Computer Science. 97:1992;1-66
5. Vincent Danos, Jean-Baptiste Joinet, and Harold Schellinx. The structure of exponentials: Uncovering the dynamics of linear logic proofs. In G. Gottlob, A. Leitsch, and D. Mundici, editors, Proceedings of the Third Kurt Godel Colloquium on Computational Logic and Proof Theory, pages 159 - 171. Springer-Verlag LNCS 713, 1993.
6. Martini Simone, Masini Andrea. 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
7. Max I. Kanovich and Takayasu Ito. Temporal linear logic specifications for concurrent processes. In Proceedings of the Twelfth Annual IEEE Symposium on Logic in Computer Science, Warsaw, Poland, 1997.
8. Amir Pnueli. The temporal logic of programs. In Proc. 18-th Annual Symposium on the Foundations of Computer Science, pages 46 - 57. 1977.
9. Lafont Yves. The undecidability of second order linear logic without exponentials. Journal of Symbolic Logic. 61:1996;541-548
10. Lafont Yves, Scedrov Andre. The undecidability of second order multiplicative linear logic. Information and Computation. 125:1996;46-51
11. Mitsuhiro Okada. Phase semantics for higher order completeness, cut-elimination and normalization proofs (extended abstract). In J.-Y. Girard, M. Okada, and A. Scedrov, editors, ENTCS (Electronic Notes in Theoretical Computer Science) Vol.3: A Special Issue on Linear Logic 96, Tokyo Meeting. URL: http://www.elsevier.nl/locate/entcs/volume3.html, 1996. Pull version submitted to Theoretical Computer Science, also available by anonymous ftp at http://abelard.flet.mita.keio.ac.jp/person/mitsu/paper.html or ftp://abelard.flet.mita.keio.ac.jp/pub/Papers/mitsu.
12. Jean-Yves Girard. Une extension de I'interpretation de Gödel a l'analyse, et son application a l'elimination des coupures dans l'analyse et la theorie des types. In J.P. Fenstad, editor, Proceedings of the Second Scandinavian Logic Symposium, pages 63 - 92. North-Holland, 1971.