Abstract
We prove strong normalization of tq-reduction for all standard versions of sequent calculus for classical and intuitionistic (second and first order) logic and give a perspicuous argument for the completeness of the focusing restriction on sequent derivations.
Research part of the project ‘Geometry & Logic’, financed by the Netherlands Organization for Scientific Research (NWO)
supported by a fellowship of the Consiglio Nazionale delle Ricerche (CNR)
Preview
Unable to display preview. Download preview PDF.
References
Andreoli, J. M. (1992). Logic programming with focusing proofs in linear logic. Journal of Logic and Computation, 2(3):297–347.
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.
Danos, V., Joinet, J.-B., and Schellinx, H. (1995). A new deconstructive logic: linear logic. Preprint 936, Department of Mathematics, Utrecht University. (To appear in the Journal of Symbolic Logic).
Danos, V., Joinet, J.-B., and Schellinx, H. (1995). LKT and LKQ: sequent calculi for second order logic based upon dual linear decompositions of classical implication. In Girard, J.-Y., Lafont, Y., and Regnier, L., editors, Advances in Linear Logic, pages 211–224. Cambridge University Press.
Girard, J.-Y. (1987). Linear logic. Theoretical Computer Science, 50:1–102.
Girard, J.-Y. (1991). Quantifiers in linear logic II. In Corsi, G. and Sambin, G., editors, Nuovi problemi della logica e delta filosofia delta scienza, Volume II. CLUEB, Bologna(Italy).
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.
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.
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.
Schellinx, H. (1994). The Noble Art of Linear Decorating. ILLC Dissertation Series, 1994-1. Institute for Language, Logic and Computation, University of Amsterdam.
Tammet, T. (1994). Proof search strategies in linear logic. Journal of Automated Reasoning, 12:273–304.
Tortora de Falco, L. (1994). Strong normalization property for heterostyle LKtq and FD. Prépublication 53, Équipe de Logique Mathématique, Université Paris VII.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Joinet, JB., Schellinx, H., Tortora de Falco, L. (1996). Strong normalization for all-style LKtq . In: Miglioli, P., Moscato, U., Mundici, D., Ornaghi, M. (eds) Theorem Proving with Analytic Tableaux and Related Methods. TABLEAUX 1996. Lecture Notes in Computer Science, vol 1071. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61208-4_15
Download citation
DOI: https://doi.org/10.1007/3-540-61208-4_15
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61208-7
Online ISBN: 978-3-540-68368-1
eBook Packages: Springer Book Archive