LJQ: A strongly focused calculus for intuitionistic logic

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

Volumn 3988 LNCS, Issue , 2006, Pages 173-185

  Dyckhoff, Roy ^a   Lengrand, Stéphane ^a  

^a UNIVERSITY OF ST ANDREWS   (United Kingdom)

Author keywords

Call by value semantics; Depth bounded; Focused; Guarded logic; Purification; Sequent calculus

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTABILITY AND DECIDABILITY; COMPUTER SCIENCE; SEMANTICS; THEOREM PROVING;

CALL-BY-VALUE SEMANTICS; DEPTH-BOUNDED; FOCUSED; GUARDED LOGIC; SEQUENT CALCULUS;

FORMAL LOGIC;

EID: 33746102202     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11780342_19     Document Type: Conference Paper

References (34)

1. J.-M. Andreoli. Logic programming with focusing proofs in linear logic, J. Logic & Computation 2, 297-347, 1992.
2. B. Cooper, J. Truss. "Sets and Proofs", (Proceedings of Logic Colloquium 97), Cambridge University Press, 1999.
3. V. Danos, J.-B. Joinet, H. Schellinx. LKQ and LKT: sequent calculi for second order logic based upon dual linear decompositions of classical implication, in [15], pp 211-224.
4. A. G. Dragalin. "Mathematical Intuitionism", Translations of Mathematical Monographs, 67, Amer. Math. Soc., Providence, Rhode Island, 1988.
5. R. Dyckhoff. Contraction-free sequent calculi for intuitionistic logic, J. Symbolic Logic 57, 795-807, 1992.
6. R. Dyckhoff, S. Lengrand, D. Kesner. Strong cut-elimination systems for Hudelmaiers depth-bounded sequent calculus for implicational logic, submitted, 2006.
7. R. Dyckhoff, S. Negri. Admissibility of structural rules for contraction-free systems of intuitionistic logic, J. Symbolic Logic 65, 1499-1518, 2000.
8. R. Dyckhoff, S. Negri. Admissibility of structural rules for extensions of contraction-free sequent calculi, Logic J. of the IGPL 9, 573-580, 2001
9. R. Dyckhoff, L. Pinto. Proof search in constructive logics, in [2], 53-65.
10. R. Dyckhoff, L. Pinto. Cut-elimination and a permutation-free sequent calculus for intuitionistic logic, Studia Logica 60, 107-118, 1998.
11. R. Dyckhoff, A. Simpson. Proof theory of guarded logics, MS, 2004.
12. R. Dyckhoff, C. Urban. Strong normalization of Herbelin's explicit substitution calculus with substitution propagation, J. Logic & Comput. 13, 689-706, 2003.
13. R. Dyckhoff. Variations on a theme of Hudelmaier, MS, 2006.
14. J. Espírito Santo. Unity in structural proof theory and structural extensions of the λ-calculus, MS available from http://www.math.uminho. pt/~jes/Publications.htm, Jul 2005.
15. J.-Y. Girard, Y. Lafont, L. Regnier (eds). "Advances in Linear Logic", LMS Lecture Note Series 222, Cambridge University Press, 1995.
16. H. Herbelin. Séquents qu'on calcule, Thèse de Doctorat, Université Paris 7, 1995.
17. H. Herbelin. A λ-calculus structure isomorphic to sequent calculus structure, in [29], 67-75.
18. J. Hudelmaier. Bounds for cut-elimination in intuitionistic prepositional logic, PhD thesis, Tübingen, 1989.
19. J. Hudelmaier. An O(n log(n)) decision procedure for intuitionistic prepositional logic, J. of Logic & Computation 3, 63-75, 1993.
20. J.-B. Joinet. Étude de la normalisation du calcul des séquents classique à travers la logique linéaire, Thèse de Doctorat, Université Paris 7, 1993.
21. S. Lengrand. Normalisation and equivalence in proof theory and type theory, Draft PhD thesis (Paris 7 & St Andrews), 2006.
22. S. Lengrand, R. Dyckhoff. Type theory in sequent calculus, submitted, 2006.
23. D. Miller, G. Nadathur, F. Pfenning, A. Scedrov. Uniform proofs as a foundation for logic programming, Ann. Pure Appl. Log. 91, 125-157, 1991.
24. G. Mints. Normal forms for sequent derivations, in [28], 469-492.
25. E. Moggi. Computational lambda-calculus and monads, Report ECS-LFCS-88-66, University of Edinburgh, 1988.
26. S. Negri. Sequent calculus proof theory of intuitionistic apartness and order relations, Arch. Math. Logic 38, 521-547, 1999.
27. S. Negri. Conservativity of apartness over equality, revisited, Research Report CS/99/4, University of St Andrews, 6 pp, 1999.
28. P. Odifreddi (ed). "Kreiseliana", A. K. Peters, Wellesley, Mass., 1996.
29. L. Pacholski, J. Tiuryn (eds). "Proceedings of Computer Science Logic 1994", LNCS 933, Springer, 1995.
30. G. Plotkin. Call-by-name, call-by-value and the lambda-calculus, Theoret. Cornput. Sci. 1, 125-159, 1975.
31. A. Sabry, M. Felleisen. Reasoning about programs in continuation-passing style, Lisp and Symb. Comput. 6, 289-360, 1993.
32. A. S. Troelstra, Marginalia on sequent calculi, Studia Logica 62, 291-303, 1999.
33. A. S. Troelstra, H. Schwichtenberg. "Basic Proof Theory", Cambridge University Press, 2nd ed., 2000.
34. N. N. Vorob'ev. A new algorithm for derivability in the constructive prepositional calculus, Amer. Math. Soc. Translations, ser. 2, vol. 94, 37-71, 1970.