Focusing and polarization in intuitionistic logic

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

Volumn 4646 LNCS, Issue , 2007, Pages 451-465

  Liang, Chuck ^a   Miller, Dale ^b  

^a HOFSTRA UNIVERSITY   (United States)

^b ECOLE POLYTECHNIQUE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; LINEAR PROGRAMMING; ONLINE SEARCHING; THEOREM PROVING;

INTUITIONISTIC LOGIC; LINEAR LOGIC; PROOF NORMALIZATION; PROOF SEARCH; PROOF SYSTEMS;

LOGIC PROGRAMMING;

EID: 38049023971     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-74915-8_34     Document Type: Conference Paper

References (18)

1. Andreoli, J.-M.: Logic programming with focusing proofs in linear logic. J. of Logic and Computation 2(3), 297-347 (1992)
2. Chaudhuri, K.: The Focused Inverse Method for Linear Logic. PhD thesis, Carnegie Mellon UniversityTechnical report CMU-CS-06-162 (December 2006)
3. Chaudhuri, K., Pfenning, F., Price, G.: A logical characterization of forward and backward chaining in the inverse method. In: Furbach, U., Shankar, N. (eds.) IJCAR 2006. LNCS (LNAI), vol. 4130, pp. 97-111. Springer, Heidelberg (2006)
4. Curien, P.-L., Herbelin, H.: The duality of computation. In: ICFP '00. Proceedings of the fifth ACM SIGPLAN international conference on Functional programming, New York, NY, USA, pp. 233-243. ACM Press, New York (2000)
5. 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: Girard, Lafont, Regnier (eds.) Workshop on Linear Logic. London Mathematical Society Lecture Notes 222, pp. 211-224. Cambridge University Press, Cambridge (1995)
6. Danos, V., Joinet, J.-B., Schellinx, H.: A new deconstructive logic: Linear logic. Journal of Symbolic Logic 62(3), 755-807 (1997)
7. Dyckhoff, R., Lengrand, S.: LJQ: a strongly focused calculus for intuitionistic logic. In: Beckmann, A., Berger, U., Löwe, B., Tucker, J.V. (eds.) CiE 2006. LNCS, vol. 3988, pp. 173-185. Springer, Heidelberg (2006)
8. Girard, J.-Y.: Linear logic. Theoretical Computer Science 50, 1-102 (1987)
9. Girard, J.-Y.: A new constructive logic: classical logic. Math. Structures in Comp. Science 1, 255-296 (1991)
10. Girard, J.-Y.: On the unity of logic. Annals of Pure and Applied Logic 59, 201-217 (1993)
11. Herbelin, H.: Séquents qu'on calcule: de l'interprétation du calcul des séquents comme calcul de lambda-termes et comme calcul de stratégies gagnantes. PhD thesis, Université Paris 7 (1995)
12. Howe, J.M.: Proof Search Issues in Some Non-Classical Logics. PhD thesis, University of St Andrews, Available as University of St Andrews Research Report CS/99/1 (December 1998)
13. Jagadeesan, R., Nadathur, G., Saraswat, V.: Testing concurrent systems: An interpretation of intuitionistic logic. In: Ramanujam, R., Sen, S. (eds.) FSTTCS 2005. LNCS, vol. 3821, Springer, Heidelberg (2005)
14. Laurent, O., Quatrini, M., de Falco, L.T.: Polarized and focalized linear and classical proofs. Ann. Pure Appl. Logic 134(2-3), 217-264 (2005)
15. Levy, P.B.: Jumbo lambda-calculus. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol. 4052, Springer, Heidelberg (2006)
16. Liang, C., Miller, D.: On focusing and polarities in linear logic and intuitionistic logic. Unpublished report (December 2006)
17. Miller, D., Nadathur, G., Pfenning, F., Scedrov, A.: Uniform proofs as a foundation for logic programming. Annals of Pure and Applied Logic 51, 125-157 (1991)
18. Pfenning, F.: Automated theorem proving. Lecture notes (March 2004)