Efficient loop-check for backward proof search in some non-classical propositional logics
- 1 January 1996
- book chapter
- Published by Springer Nature
- p. 210-225
- https://doi.org/10.1007/3-540-61208-4_14
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- A Contraction-Free Sequent Calculus for S4Published by Springer Nature ,1996
- Propositional logics on the computerPublished by Springer Nature ,1995
- Basic Modal LogicPublished by Oxford University Press (OUP) ,1993
- An O(n log n)-Space Decision Procedure for Intuitionistic Propositional LogicJournal of Logic and Computation, 1993
- Contraction-free sequent calculi for intuitionistic logicThe Journal of Symbolic Logic, 1992
- Algorithmic proof with diminishing resources part 1Published by Springer Nature ,1991
- Proof Methods for Modal and Intuitionistic LogicsPublished by Springer Nature ,1983
- Modal LogicPublished by Cambridge University Press (CUP) ,1980
- The Computational Complexity of Provability in Systems of Modal Propositional LogicSIAM Journal on Computing, 1977
- Temporal LogicPublished by Springer Nature ,1971