Abstract
AbstractWe 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.
Publisher
Cambridge University Press (CUP)
Reference5 articles.
1. The monotone circuit complexity of boolean functions
2. Lower bounds on the monotone complexity of some Boolean functions;Razborov;Soviet Mathematics Doklady,1985
Cited by
37 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. On the proof complexity of logics of bounded branching;Annals of Pure and Applied Logic;2023-01
2. Proof Complexity of Modal Resolution;Journal of Automated Reasoning;2021-10-13
3. Index;Proof Complexity;2019-03-28
4. Bibliography;Proof Complexity;2019-03-28
5. The Nature of Proof Complexity;Proof Complexity;2019-03-28