Admissibility of structural rules for contraction-free systems of intuitionistic logic

Journal of Symbolic Logic

Volumn 65, Issue 4, 2000, Pages 1499-1518

  Dyckhoff, Roy ^a   Negri, Sara ^b  

^a UNIVERSITY OF ST ANDREWS   (United Kingdom)

^b UNIVERSITY OF HELSINKI   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0034557590     PISSN: 00224812     EISSN: None     Source Type: Journal    
DOI: 10.2307/2695061     Document Type: Article

References (30)

1. A. AVELLONE and M. FERRARI, Almost duplication-free tableau calculi for propositional Lax logics, Theorem proving with analytic tableaux and related methods, Lecture Notes in Computer Science, vol. 1071, Springer-Verlag, 1996, pp. 48-65.
2. B. BARRAS, S. BOUTIN, et al., The Coq proof assistant reference manual, Technical report, INRIA, 1996, available from ftp.inria.fr.
3. H. BENL, U. BERGER, H. SCHWICHTENBERG, M. SEISENBERGER, and W. ZUBER, Proof theory at work: Program development in the Minlog system, Automated deduction - A basis for applications, vol. II, Kluwer, 1998.
4. A. G. DRAGALIN, Mathematical intuitionism, Translations of Mathematical Monographs, vol. 67, American Mathematical Society, Providence, Rhode Island, 1988.
5. R. DYCKHOFF, Implementation of a decision procedure for intuitionistic propositional logic, available from http ://www-theory.dcs.st-and.ac.uk/~rd/software/.
6. _, Contraction-free sequent calculi for intuitionistic logic, this JOURNAL, vol. 57 (1992), no. 3, pp. 795-807.
7. _, Dragalin's proofs of cut-admissibility for the intuitionistic sequent calculi G3i and G3i′. Research Report CS/97/8, Computer Science Division, St Andrews University, 1997, available from http://www-theory.dcs.st-and.ac. uk/~rd/publications/.
8. R. DYCKHOFF and L. PINTO, Implementation of a counter-model construction procedure for intuitionistic propositional logic, available from http://www-theory.dcs.st-and.ac.uk/~rd/software/.
9. A. HEUERDING, G. JäGER, S. SCHWENDIMANN, and M. SEYFRIED, Propositional logics on the computer, Theorem proving with analytic tableaux and related methods, Lecture Notes in Computer Science, vol. 918, Springer-Verlag, 1995, pp. 310-323.
10. J. HUDELMAIER, A Prolog program for intuitionistic logic, SNS-Bericht 88-28, University of Tübingen, 1988.
11. _, Bounds for cut elimination in intuitionistic propositional logic, Ph.D. thesis, University of Tübingen, 1989.
12. _, Bounds for cut elimination in intuitionistic propositional logic, Archive for Mathematical Logic, vol. 31 (1992), pp. 331-354.
13. _, An O(n log n)-space decision procedure for intuitionistic propositional logic, Journal of Logic and Computation, vol. 3 (1993), pp. 63-76.
14. _, personal communication, 1994.
15. P. LINCOLN, A. SCEDROV, and N. SHANKAR, Linearizing intuitionistic implication, Sixth annual IEEE symposium on logic in computer science proceedings, Amsterdam 1991, 1991, pp. 51-62.
16. M. MENDLER, A timing refinement of intuitionistic proofs and its application to the timing analysis of combinational circuits, Theorem proving with analytic tableaux and related methods, Lecture Notes in Computer Science, vol. 1071, Springer-Verlag, 1996, pp. 261-277.
17. P. MIGLIOLI, U. MOSCATO, and M. ORNAGHI, Avoiding duplications in tableau systems for intuitionistic logic and Kuroda logic, Logic Journal of the IGPL, vol. 5 (1997), no. 1, pp. 145-167.
18. S. NEGRI, Sequent calculus proof theory of intuitionistic apartness and order relations, Archive for Mathematical Logic, vol. 38 (1999), no. 8, pp. 521-547.
19. S. NEGRI and J. VON PLATO, From Kripke models to algebraic counter-valuations, Automated reasoning with analytic tableaux and related methods, proceedings (H. de Swart, editor), Lecture Notes in Artificial Intelligence, vol. 1397, Springer-Verlag, 1998, pp. 247-261.
20. L. PAULSON, Isabelle: A generic theorem prover, Lecture Notes in Computer Science, vol. 828, Springer-Verlag, 1994.
21. L. PINTO and R. DYCKHOFF, Loop-free construction of counter-models for intuitionistic propositional logic, Symposia Gaussiana, Conf. A (Behara, Fritsch, and Lintz, editors), Walter de Gruyter & Co., Berlin, 1995, pp. 225-232.
22. A. PITTS, On an interpretation of second-order quantification in first-order intuitionistic propositional logic, this JOURNAL, vol. 57 (1992), no. 1, pp. 33-52.
23. H. SCHWICHTENBERG, personal communication, 1996.
24. A. STOUGHTON, Porgi: a proof-or-refutation generator for intuitionistic propositional logic, Proceedings of the CADE-13 workshop on proof search in type-theoretic languages (D. Galmiche, editor), 1996, pp. 109-116.
25. N. TENNANT, Autologic, Edinburgh University Press, 1992.
26. A. S. TROELSTRA and H. SCHWICHTENBERG, Basic proof theory, Cambridge University Press, 1996.
27. J. VON PLATO, Positive Heyting algebras, manuscript, 1997.
28. N. N. VOROB'EV, A new algorithm for derivability in the constructive prepositional calculus, American Mathematical Society Translations, series 2, vol. 94, 1970, pp. 37-71.
29. K. WEICH, Beweissuche in der intuitionistischen Logik, Diplomarbeit, Institut für Mathematik, University of Munich, 1995.
30. _, Decision procedures for intuitionistic propositional logic by program extraction, Automated reasoning with analytic tableaux and related methods, proceedings (H. de Swart, editor), Lecture Notes in Artificial Intelligence, vol. 1397, Springer-Verlag, 1998, pp. 292-306.