Strong normalization for all-style LKtq

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1071, Issue , 1996, Pages 226-243

  Joinet, Jean Baptiste ^a,b,c   Schellinx, Harold ^a,b   De Falco, Lorenzo Tortora ^b  

^a INSTITUT DE MATHÉMATIQUES DE JUSSIEU   (France)

^b UTRECHT UNIVERSITY   (Netherlands)

^c UNIVERSITÉ PARIS 1 PANTHÉON SORBONNE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; DIFFERENTIATION (CALCULUS);

FIRST ORDER; SEQUENT CALCULUS; STANDARD VERSIONS; STRONG NORMALIZATION;

THEOREM PROVING;

EID: 84958966439     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61208-4_15     Document Type: Conference Paper

References (12)

1. ANDREOLI, J. M. (1992). Logic programming with focusing proofs ill linear logic. Journal of Logic and Computation, 2(3):297-347.
2. DANOS, V., JOINET, J.-B., and SCHELLINX, H. (1993). The structure of exponentials: uncovering the dynamics of linear logic proofs. In Gottlob, G., Leitsch, A., and Mundici, D., editors, Computational Logic and Proof Theory, pages 159-171. Springer Verlag. Lecture Notes in Computer Science 713.
3. DANOS, V., JOINET, J.-B., and SCHELLINX, H. (1995). A new deconstructive logic: linear logic. Preprint 936, Department of Matllematics, Utrecht University. (To appear in the Journal of Symbolic Logic).
4. DANOS, V., JOINET, J.-B., and SCHELLINX, H. (1995). LKT and LKQ: sequent calculi for second order logic based’ upon dual linear r of classical implication. In Girard, J.-Y., Lafont, Y., and Regnier, L., editors, Advances in Linear Logic, pages 211-224. Cambridge University Press.
5. GIRARD, J.-Y. (1987). Linear logic. Theoretical Computer Science, 50:1-102.
6. GIRARD, J.-Y. (1991). Quantifiers in linear logic II. In Corsi, G. and Sambin, G., editors, Nuovi problemi della loyiea e della filosofia della seienza, Volume 11. CLUEB, Bologna(Italy).
7. JOINET, J.-B. (1993). Etude de la normalisation du calcul des séquents classique á travers la logique linéaire. Thése de Doctorat, Université Paris VII.
8. PARIGOT, M. (1991). Free Deduction: an analysis of computation in classical logic. In Voronkov, A., editor, Russian Conference on Logic Programming, pages 361-380. Springer Verlag. Lecture Notes in Artificial Intelligence 592.
9. SCHELLINX, H. (1994). A linear approach to modal proof theory. To appear in H. Wansing, ed., ‘Proof Theory of Modal Logic’. Studies in Applied Logic, Kluwer Academic Publishers.
10. SCHELLINX, H. (1994). The Noble Art of Linear Decorating. ILLC Dissertation Series, 1994-1. Institute for Language, Logic and Colnputation, University of Amsterdam.
11. TAMMET, T. (1994). Proof search strategies in linear logic. Journal of Automated Reasoning, 12:273-304.
12. L. Tortora De Falco, (1994). Strong normalization property for heterostyle LK tq and FD. Prépublication 53, Équipe de Logique Mathématique, Universit6 Paris VII.