Strong normalization for all-style LKtq

4Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

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.

Cite

CITATION STYLE

APA

Joinet, J. B., Schellinx, H., & De Falco, L. T. (1996). Strong normalization for all-style LKtq. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1071, pp. 226–243). Springer Verlag. https://doi.org/10.1007/3-540-61208-4_15

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free