Phase semantic cut-elimination and normalization proofs of first- and higher-order linear logic

Theoretical Computer Science

Volumn 227, Issue 1-2, 1999, Pages 333-396

  Okada, Mitsuhiro ^a  

^a KEIO UNIVERSITY   (Japan)

Author keywords

Cut elimination; Higher order logic; Linear logic; Normalization theorem; Phase semantics

Indexed keywords

EID: 0000610062     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(99)00058-4     Document Type: Article

References (27)

1. V.M. Abrusci, Sequent calculus for intuitionistic linear propositional logic, in: Mathematical Logic, Plenum Press, New York, 1990.
2. V.M. Abrusci, Non-commutative intuitionistic linear logic, Z. Math. Logik Grundlagen Math. 36 (1990).
3. V. Danos, La Logique Linéaire appliquée à l'étude de divers processus de normalisation, Thèse de doctorat, Université de Paris 7, 1990.
4. V. Danos, L. Regnier, The structure of multiplicatives, Arch. Math. Logic 28 (1989).
5. J.-Y. Girard, Doctoral Thesis, Univ. Paris VII, 1972.
6. Also in: Proc. 2nd Scandinavian Logic Symp., North-Holland, Amsterdam, 1973.
7. J.-Y. Girard, Linear logic, Theoret. Comput. Sci. 50 (1987).
8. J.-Y. Girard, Linear logic: its syntax and semantics, in: Girard, Lafont and Regnier (Eds.), Advances in Linear Logic, Cambridge University Press, Cambridge, 1995.
9. J.-P. Jouannaud, M. Okada, A computation model for excecutable higher-order algebraic specification languages, in: Proc. LICS 91, IEEE Internat. Symp. on Logic in Computer Science, IEEE Press, New York, 1991.
10. M. Kanovitch, M. Okada, A. Scedrov, Phase semantics for light linear logic, Theoret. Comput. Sci., to appear. A former version appeared in: Proc. Internat. Conf. Mathematical Foundations of Programming Languages, Electronic Notes of Theoretical Computer Science 6 (1997).
11. M. Kanovitch, M. Okada, A. Scedrov, Phase semantics for light linear logic, Theoret. Comput. Sci., to appear. A former version appeared in: Proc. Internat. Conf. Mathematical Foundations of Programming Languages, Electronic Notes of Theoretical Computer Science 6 (1997).
12. Y. Lafont, La logique lineaire du second-order sans exponentielle est indecidable (version preliminaire), December 1994.
13. Y. Lafont, From proof-nets to interaction nets, in: Girard, Lafont and Regnier (Eds.), Advances in Linear Logic, Cambridge University Press, Cambridge, 1995.
14. Y. Lafont, The finite model property for various fragments of linear logic, J. Symbolic Logic, to appear.
15. Y. Lafont, A. Scedrov, The undecidability of second-order multiplicative linear logic, Inform. Comput. 125 (1996) 46-51.
16. M. Okada, Phase semantics for higher-order completeness, cut-elimination and normalization proofs (extended abstract), Electronic Notes Theoret. Comput. Sci. 3 (1996) 22.
17. M. Okada, K. Terui, The finite model property for various fragments of intuitionistic linear logic, J. Symbolic Logic, to appear.
18. H. Ono, Phase structures and quantales, Lecture at the Tubingen Conf. "Logic with Restricted Logical Rules", 1991.
19. D. Prawitz, Hauptsatz for higher-order logic, J. Symbolic Logic (1968) 452-457.
20. L. Regnier, Lambda-calcul et réseaux, Thèse de doctorat, Université de Paris 7, 1992.
21. G. Sambin, Intuitionistic formal space, in: Logic Colloquium 88, North-Holland, Amsterdam, 1989.
22. K. Scütte, Beweisstheorie, Springer, Berlin.
23. W. Tait, A nonconstructive proof of Gentzen's Hauptsatz for second-order predicate logic, Bull. Amer. Math. Soc. 72, 980-983.
24. W. Tait, Intensional interpretation of functionals of finite type I, J. Symbolic Logic 32 (1967) 198-212.
25. M. Takahashi, A proof of cut-elimination theorem in simple type theory, J. Math. Soc. Japan 19 (1967) 399-410.
26. Gaisi Takeuti, Proof Theory, North-Holland, Amsterdam, 1985.
27. A. Troelstra, Lectures on Linear Logic, CSLI Lecture Notes, No. 29, 1991, Stanford.