Article contents
Completeness and decidability of tense logics closely related to logics above K4
Published online by Cambridge University Press: 12 March 2014
Abstract
Tense logics formulated in the bimodal propositional language are investigated with respect to Kripke-completeness (completeness) and decidability. It is proved that all minimal tense extensions of modal logics of finite width (in the sense of K. Kine) as well as all minimal tense extensions of cofinal subframe logics (in the sense of M. Zakharyaschev) are complete. The decidability of all finitely axiomatizable minimal tense extensions of cofinal subframe logics is shown. A number of variations and extensions of these results are also presented.
- Type
- Research Article
- Information
- Copyright
- Copyright © Association for Symbolic Logic 1997
References
REFERENCES
- 10
- Cited by