On the intuitionistic force of classical search

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

Volumn 1071, Issue , 1996, Pages 295-311

  Ritter, Eike ^a   Pym, David ^b   Wallen, Lincoln ^c  

^a UNIVERSITY OF BIRMINGHAM   (United Kingdom)

^b QUEEN MARY UNIVERSITY OF LONDON   (United Kingdom)

^c UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; FORMAL LOGIC; RECONFIGURABLE HARDWARE; THEOREM PROVING;

CLASSICAL LOGIC; CLASSICAL PROPOSITIONAL LOGIC; COMBINATORICS; INTUITIONISTIC LOGIC; LAMBDA-MU CALCULUS; NATURAL DEDUCTION; PROOF PROCEDURES; SOUND AND COMPLETE;

COMPUTER CIRCUITS;

EID: 84958977768     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61208-4_19     Document Type: Conference Paper

References (28)

1. H. Barendregt. Lambda calculi with types. In: S. Abramsky, Dov M. Gabbay and T. S. E. Maibaum (editors), Handbook o] Logic in Computer Science, Volume 2, 117-310, Oxford Science Publications, 1992.
2. M. Dummett. Elements of lntuitionism. Oxford University Press, 1980.
3. M.C. Fitting. Resolution for intuitionistic logic. In Z. W. Ras and M. Zemankova (editors), Methodologies for intelligent systems, 400-407, Elsevier, 1987.
4. M.C. Fitting. First-order modal tableaux. Journal of Automated Reasoning, 4:191-214, 1988.
5. G. Gentzen. Untersuchungen fiber das logische Schliessen. Mathematische Zeitschrifl, 176-210, 405-431, 1934.
6. J. Herbrand. Investigations in proof theory. In: J. van Heijenoort (editor), From Frege to Gödel, Harvard University Press, 1967.
7. H. Herbelin. A λ-calculus structure isomorphic to sequent calculus structure. In: Proc. Computer Science Logic '94, Kazimierz, Poland, Lecture Notes in Computer Science 933, Springer, 1995.
8. R. Hähnle and P.H. Schmitt. The liberalized 6-rule in free variable semantic tableaux. Journal of Automated Reasoning, 13(2):211-222, 1994.
9. S.C. Kleene. Permutability of inferences in Gentzen's calculi LK and LJ. Mere. Amer. Math. Sot., 10:1-26, 1952.
10. J.W. Klop. Term Rewriting Systems. In: S. Abramsky, Dov M. Gabbay and T. S. E. Malbanm (editors), Handbook of Logic in Computer Science, Volume 2, 1-116, Oxford Science Publications, 1992.
11. B. Meltzer. Prolegomena to a theory of efficiency of proof procedures. In: Artificial Intelligence and Heuristic Programming, 15-33, Edinburgh University Press, 1971.
12. D. Miller, G. Nadathur, A. Ščiedrov, and F. Pfenning. Uniform proofs as a foundation for logic programming. Ann. Pure App. Logic, 51:125-157, 1991.
13. H.-J. Ohlbach. A resolution calculus for modal logics. In: E. Lusk and R. Overbeek (editors), Proc. 9th. CADE, Lecture Notes in Computer Science 310, 500-516, Springer, 1988.
14. M. Parigot. λμ-calculus: an algorithmic interpretation of classical natural deduction. In: Proc. LPAR 92, St. Petersburg, Lecture Notes in Computer Science 624, 190-201, Springer, 1992.
15. M. Parigot. Church-Rosser property in classical free deduction. In: Logical Environments, G. Huet and G. Plotkin (editors), Cambridge University Press, 1993.
16. M. Parigot. Strong normalization for second order classical natural deduction. In: Proc. LICS 93, 39-47, IEEE Computer Soc. Press, 1993.
17. D. Prawitz. Natural deduction: a prooftheoretical study. Almqvist & Wiksell, Stockholm, 1965.
18. D.J. Pyre. Proofs, Search and Computation in General Logic. Ph.D. thesis, University of Edinburgh, 1990.
19. D.J. Pyre. A note on the proof theory of the λII-calculus. Studia Logica, 54:199-230, 1995.
20. D.J. Pyre and J.A. Harland. A uniform proof-theoretic investigation of linear logic programming. Journal of Logic and Computation, 4(2):175-207, 1994.
21. D.J. Pyre and L.A. Wallen. Proofsearch in the λII-calculus. In: G. Huet and G. Plotkin (editors), Logical Frameworks, 309-340, Cambridge University Press, 1991.
22. D.J. Pyre and L.A. Wallen. Logic programming via proof-valued computations. In: K. Broda (editor), UK Con- Ierence on Logic Programming, 253-262, Springer WICS, 1992.
23. N. Shankar. Proof search in the intuitionistic sequent calculus. In: D. Kaput (editor), Proc. CADE 11, Lecture Notes in Artificial Intelligence 607, Springer, 1992.
24. R.M. Smullyan. First-order logic, Ergebnisse der Mathematik 43, Springer, 1968.
25. L.A. Wallen. Generating connection calculi from tableau- and sequent-based proof systems. In: A.G. Cohn and J.R. Thomas (editors), Artificial Intelligence and its Applications, 35-50, John Wiley & Sons, 1986. Proc. AISB 85, Warwick, England, April 1985.
26. L.A. Wallen. Matrix proof methods for modal logics. In: J. McDermott (editor), Proc. lOth. IJCAI, 917-923, Morgan Kanfmann, 1987.
27. L.A. Wallen. Automated Deduction in Non-Classical Logics. MIT Press, 1990.
28. J. Zucker. The correspondence between cut-elimination and normalisation. Ann. Math. Logic 7, 1-112, 1974.