Abstract
LJQ is a focused sequent calculus for intuitionistic logic, with a simple restriction on the first premisss of the usual left introduction rule for implication. We discuss its history (going back to about 1950, or beyond), present the underlying theory and its applications both to terminating proof-search calculi and to call-by-value reduction in lambda calculus.
Thanks are due to James McKinna and Christian Urban for useful suggestions, to Hugo Herbelin and Sara Negri for stimulating questions, to José Carlos Espírito Santo for his unpublished [14] and to Jörg Hudelmaier for a copy of his thesis [18].
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Andreoli, J.-M.: Logic programming with focusing proofs in linear logic. J. Logic & Computation 2, 297–347 (1992)
Cooper, B., Truss, J.: Sets and Proofs. In: Proceedings of Logic Colloquium, vol. 97. Cambridge University Press, Cambridge (1999)
Danos, V., Joinet, J.-B., Schellinx, H.: LKQ and LKT: sequent calculi for second order logic based upon dual linear decompositions of classical implication. In: [15], pp. 211–224
Dragalin, A.G.: “Mathematical Intuitionism”. Translations of Mathematical Monographs, vol. 67. Amer. Math. Soc., Providence, Rhode Island (1988)
Dyckhoff, R.: Contraction-free sequent calculi for intuitionistic logic. J. Symbolic Logic 57, 795–807 (1992)
Dyckhoff, R., Lengrand, S., Kesner, D.: Strong cut-elimination systems for HudelmaierÕs depth-bounded sequent calculus for implicational logic (submitted, 2006)
Dyckhoff, R., Negri, S.: Admissibility of structural rules for contraction-free systems of intuitionistic logic. J. Symbolic Logic 65, 1499–1518 (2000)
Dyckhoff, R., Negri, S.: Admissibility of structural rules for extensions of contraction-free sequent calculi. Logic J. of the IGPL 9, 573–580 (2001)
Dyckhoff, R., Pinto, L.: Proof search in constructive logics.In: [2], pp. 53–65
Dyckhoff, R., Pinto, L.: Cut-elimination and a permutation-free sequent calculus for intuitionistic logic. Studia Logica 60, 107–118 (1998)
Dyckhoff, R., Simpson, A.: Proof theory of guarded logics. MS (2004)
Dyckhoff, R., Urban, C.: Strong normalization of Herbelin’s explicit substitution calculus with substitution propagation. J. Logic & Comput. 13, 689–706 (2003)
Dyckhoff, R.: Variations on a theme of Hudelmaier. MS (2006)
Espírito Santo, J.: Unity in structural proof theory and structural extensions of the λ-calculus (July 2005) MS available from: www.math.uminho.pt/homedirjes/Publications.htm
Girard, J.-Y., Lafont, Y., Regnier, L. (eds.): Advances in Linear Logic. LMS Lecture Note Series, vol. 222. Cambridge University Press, Cambridge (1995)
Herbelin, H.: Séquents qu’on calcule, Thèse de Doctorat, Université Paris 7 (1995)
Herbelin, H.: A λ-calculus structure isomorphic to sequent calculus structure. In: [29], pp. 67–75
Hudelmaier, J.: Bounds for cut-elimination in intuitionistic propositional logic, Ph.D thesis, Tübingen (1989)
Hudelmaier, J.: An \(O(n\ log(n))\) decision procedure for intuitionistic propositional logic. J. of Logic & Computation 3, 63–75 (1993)
Joinet, J.-B.: Étude de la normalisation du calcul des séquents classique à travers la logique linéaire, Thèse de Doctorat, Université Paris 7 (1993)
Lengrand, S.: Normalisation and equivalence in proof theory and type theory, Draft Ph.D thesis (Paris 7 & St Andrews) (2006)
Lengrand, S., Dyckhoff, R.: Type theory in sequent calculus (submitted, 2006)
Miller, D., Nadathur, G., Pfenning, F., Scedrov, A.: Uniform proofs as a foundation for logic programming. Ann. Pure Appl. Log. 91, 125–157 (1991)
Mints, G.: Normal forms for sequent derivations. In: [28], pp. 469–492
Moggi, E.: Computational lambda-calculus and monads, Report ECS-LFCS-88-66, University of Edinburgh (1988)
Negri, S.: Sequent calculus proof theory of intuitionistic apartness and order relations. Arch. Math. Logic 38, 521–547 (1999)
Negri, S.: Conservativity of apartness over equality, revisited, Research Report CS/99/4, University of St Andrews, p. 6 (1999)
Odifreddi, P. (ed.): Kreiseliana. A. K. Peters, Wellesley, Mass (1996)
Pacholski, L., Tiuryn, J. (eds.): CSL 1994. LNCS, vol. 933. Springer, Heidelberg (1995)
Plotkin, G.: Call-by-name, call-by-value and the lambda-calculus. Theoret. Comput. Sci. 1, 125–159 (1975)
Sabry, A., Felleisen, M.: Reasoning about programs in continuation-passing style. Lisp and Symb. Comput. 6, 289–360 (1993)
Troelstra, A.S.: Marginalia on sequent calculi. Studia Logica 62, 291–303 (1999)
Troelstra, A.S., Schwichtenberg, H.: Basic Proof Theory, 2nd edn. Cambridge University Press, Cambridge (2000)
Vorob’ev, N.N.: A new algorithm for derivability in the constructive propositional calculus. Amer. Math. Soc. Translations, ser. 2, 94, 37–71 (1970)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dyckhoff, R., Lengrand, S. (2006). LJQ: A Strongly Focused Calculus for Intuitionistic Logic. In: Beckmann, A., Berger, U., Löwe, B., Tucker, J.V. (eds) Logical Approaches to Computational Barriers. CiE 2006. Lecture Notes in Computer Science, vol 3988. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11780342_19
Download citation
DOI: https://doi.org/10.1007/11780342_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-35466-6
Online ISBN: 978-3-540-35468-0
eBook Packages: Computer ScienceComputer Science (R0)