Proof search in Lax Logic

Mathematical Structures in Computer Science

Volumn 11, Issue 4, 2001, Pages 573-588

  Howe, Jacob M ^a  

^a UNIVERSITY OF KENT   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 35148885051     PISSN: 09601295     EISSN: 14698072     Source Type: Journal    
DOI: 10.1017/S0960129501003334     Document Type: Article

References (25)

1. Avellone, A. and Ferrari, M. (1996) Almost Duplication-free Tableau Calculi for Propositional Lax Logics. In: TABLEAUX'96. Springer-Verlag Lecture Notes in Artificial Intelligence 1071 48–64.
2. Benton, P.N., Bierman, G.M. and de Paiva, V. (1998) Computational Types from a Logical Perspective. Journal of Functional Programming 8 (2) 177–193. Curry, H. B. (1952) The Elimination Theorem When Modality is Present. Journal of Symbolic Logic 17 (4) 65–249.
3. Dyckhoff, R. (1992) Contraction-Free Sequent Calculi for Intuitionistic Logic. Journal of Symbolic Logic 57 (3) 795–807.
4. Dyckhoff, R. and Pinto, L. (1996) A Permutation-free Sequent Calculus for Intuitionistic Logic. Technical Report CS/96/9, University of St Andrews.
5. Dyckhoff, R. and Pinto, L. (1998) Cut-Elimination and a Permutation-free Sequent Calculus for Intuitionistic Logic. Studia Logic 60 107–118.
6. Dyckhoff, R. and Pinto, L. (1999) Permutability of Proofs in Intuitionistic Sequent Calculi. Theoretical Computer Science 212 (12) 141–155.
7. Fairtlough, M. and Mendler, M. (1994) An Intuitionistic Modal Logic with Applications to the Formal Verification of Hardware. In: Computer Science Logic, Springer-Verlag 354–68.
8. Fairtlough, M. and Mendler, M. (1997) Propositional Lax Logic. Information and Computation 137 (1) 1–33.
9. Fairtlough, M., Mendler, M. and Walton, M. (1997) First-order Lax Logic as a Framework for Constraint Logic Programming. Technical Report MIPS-9714, University of Passau.
10. Fairtlough, M. and Walton, M. (1997) Quantified Lax Logic. Technical Report CS-97-11, University of Sheffield.
11. Gabbay, D. (1991) Algorithmic Proof with Diminishing Resources, part 1. In: Computer Science Logic 1990. Springer-Verlag Lecture Notes in Computer Science 533 156–173.
12. Gentzen, G. (1969) In: Szabo, M. E. (ed.) The Collected Papers of Gerhard Gentzen, North-Holland, Amsterdam.
13. Girard, J.-Y. (1991) A New Constructive Logic: Classical Logic. Mathematical Structures in Computer Science 1 255–296.
14. Herbelin, H. (1995) A calculus Structure Isomorphic to Gentzen-style Sequent Calculus Structure. In: Pacholski, L. and Tiuryn, J. (eds.) Computer Science Logic 1994. Springer-Verlag Lecture Notes in Computer Science 933 61–75.
15. Heuerding, A. (1998) Sequent Calculi for Proof Search in Some Modal Logics, Ph. D. thesis, Universitat Bern.
16. Heuerding, A., Seyfried, M. and Zimmermann, H. (1996) Efficient Loop-Check for Backward Proof Search in Some Non-classical Propositional Logics. In: Springer-Verlag Lecture Notes in Artificial Intelligence 1071 61–75.
17. Howe, J.M. (1997) Two Loop Detection Mechanisms: A Comparison. Springer-Verlag Lecture Notes in Artificial Intelligence 1227 188–200.
18. Howe, J.M. (1998) Proof Search Issues in Some Non-Classical Logics, Ph. D. thesis, University of St Andrews. (Available as Technical Report CS/99/1 and electronically from http://www.cs.ukc.ac.uk/people/staff/jmhl
19. Howe, J.M. (1999) Proof Search in Lax Logic. Technical Report 14–99, University of Kent.
20. Hudelmaier, J. (1993) An 0(n log n)-space Decision Procedure for Intuitionistic Propositional Logic. Journal of Logic and Computation 3 (1) 63–75.
21. Mendler, M. (1993) A Modal Logic for Handling Behavioural Constraints in Formal Hardware Verification, Ph. D. thesis, University of Edinburgh. (ECS-LFCS-93-255.)
22. Miller, D., Nadathur, G., Pfenning, F. and Scedrov, A. (1991) Uniform Proofs as a Foundation for Logic Programming. Annals of Pure and Applied Logic 51 (12) 125–157.
23. Moggi, E. (1989) Computational Lambda-Calculus and Monads. In: Logic in Computer Science '89 14–23.
24. Prawitz, D. (1965) Natural Deduction. Stockholm Studies in Philosophy 3, Almqvist & Wiksell, Stockholm.
25. Walton, M. (1998) First-Order Lax Logic: A Framework for Abstraction, Constraints and Refinements, Ph. D. thesis, University of Sheffield.