×

zbMATH — the first resource for mathematics

On the size of refutation Kripke models for some linear modal and tense logics. (English) Zbl 0466.03008

MSC:
03B45 Modal logic (including the logic of norms)
03D15 Complexity of computation (including implicit computational complexity)
PDF BibTeX XML Cite
Full Text: DOI
References:
[1] S.A. Cook,The complexity of theorem proving procedures, Proceedings of Third Annual ACM Symposium on Theory of Computing (1971) 151-158. · Zbl 0253.68020
[2] R.E. Ladner,The computational complexity of provability in systems of modal prepositional logic, SIAM J. on Computing, 6 (1977) 467-480. · Zbl 0373.02025 · doi:10.1137/0206033
[3] R.P. McArthur,Tense logic D. Reidel, 1976.
[4] H. Ono andA. Nakamura,The computational complexity of satisfiability of modal propositional logic S4.3. Tech. Rep. No.C-5, Dept. of Applied Math., Hiroshima Univ. (1979).
[5] H. Rasiowa andR. Sikorski,The mathematics of metamathematics,Monografie Matematyczne 41, PWN, 1963. · Zbl 0122.24311
[6] K. Segerberg,An essay in classical modal logic,Filosofiska Studier 13, Uppsala Univ. (1971). · Zbl 0311.02028
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.