Article contents
Lower bounds for modal logics
Published online by Cambridge University Press: 12 March 2014
Abstract
We give an exponential lower bound on number of proof-lines in the proof system K of modal logic, i.e., we give an example of K-tautologies ψ1, ψ2, … s.t. every K-proof of ψi must have a number of proof-lines exponential in terms of the size of ψi. The result extends, for the same sequence of K-tautologies, to the systems K4, Gödel–Löb's logic, S andS4. We also determine some speed-up relations between different systems of modal logic on formulas of modal-depth one.
- Type
- Research Article
- Information
- Copyright
- Copyright © Association for Symbolic Logic 2007
References
REFERENCES
- 11
- Cited by