On the specification of sequent systems

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

Volumn 3835 LNAI, Issue , 2005, Pages 352-366

  Pimentel, Elaine ^a   Miller, Dale ^b  

^a FEDERAL UNIVERSITY OF MINAS GERAIS   (Brazil)

^b INRIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

DIFFERENTIATION (CALCULUS); INFERENCE ENGINES; LINEAR SYSTEMS; METADATA; THEOREM PROVING;

CALCULUS PROOF SYSTEMS; LINEAR LOGIC; PROGRAMMING-STYLE SEARCH;

LOGIC PROGRAMMING;

EID: 33745451813     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11591191_25     Document Type: Conference Paper

References (20)

1. [And92] J.-M. Andreoli. Logic programming with focusing proofs in linear logic. Journal of Logic and Computation, 2(3):297-347, 1992.
2. [Chu40] A. Church. A formulation of the simple theory of types. Journal of Symbolic Logic, 5:56-68, 1940.
3. [FM88] A. Felty and D. Miller Specifying theorem provers in a higher-order logic programming language, Ninth International Conference on Automated Deduction, 1988.
4. [Gen69] G. Gentzen. Investigations into logical deductions. In M. E. Szabo, editor, The Collected Papers of Gerhard Gentzen, pp. 68-131. North-Holland Publishing Co., Amsterdam, 1969.
5. [Gir87] J.-Y. Girard. Linear logic. Theoretical Computer Science, vol. 50, pp. 1-102, 1987.
6. [Gir93] J.-Y. Girard. On the unity of logic. Ann. of Pure and Applied Logic, 59:201-217, 1993.
7. [Gir99] J.-Y. Girard. On the meaning of logical rules I: syntax vs. semantics. Computational Logic, eds Berger and Schwichtenberg, pp. 215-272, SV, 1999.
8. [Gug05] A. Guglielmi A system of Interaction and Structure. ACM Transactions in Computational Logic, to appear, 2005.
9. [Har93] R. Harper, F. Honsell, and G. Plotkin A framework for defining logics, Journal of the ACM, vol.40(1), pp. 143-184, 1993.
10. [Mil96] Dale Miller. Forum: A multiple-conclusion specification language. Theoretical Computer Science, 165(1):201-232, September 1996.
11. [MM00] R. McDowell and D. Miller. Cut-elimination for a logic with definitions and induction. Theoretical Computer Science, 232:91-119, 2000.
12. [MP04] D. Miller and E. Pimentel. Linear logic as a framework for specifying sequent calculus. Lecture Notes in Logic 17, Logic Colloquium'99, 2004.
13. [MP02] D. Miller and E. Pimentel. Using linear logic to reason about sequent systems. Proceedings of Tableaux 2002, LNAI 2381, 2002.
14. [NM88] G. Nadathur and D. Miller. An Overview of λProlog. In Fifth International Logic Programming Conference, pp. 810-827, August 1988. MIT Press.
15. [Pfn89] F. Pfenning. Elf: A Language for Logic Definition and Verified Metaprogramming. Fourth Annual Symposium on Logic in Computer Science, 1989.
16. [Pfn95] F. Pfenning. Structural Cut Elimination. Proceedings, Tenth Annual IEEE Symposium on Logic in Computer Science, 1995.
17. [Pfn00] F. Pfenning. Structural Cut Elimination: I. Intuitionistic and Classical Logic. Information and Computation, 157(1-2) pp. 84-141, 2000.
18. [Pim01] E. G. Pimentel. Logica linear e a especificação de sistemas computacionais. PhD thesis, Universidade Federal de Minas Gerais, Belo Horizonte, M.G., Brasil, December 2001. (written in English).
19. [Pim05] E. G. Pimentel. Cut elimination for Llinda, 2005. Draft available from http://www.mat.ufmg.br/~elaine
20. [Tiu04] A. Tiu. A Logical Framework for Reasoning about Logical Specifications. PhD thesis, Penn State University, 2004.