Completeness and decidability of tense logics closely related to logics above K4
AbstractTense 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.
Keyword(s):
1997 ◽
Vol 51
(8)
◽
pp. 77-84
2010 ◽
Vol 20
(3)
◽
pp. 279-304
◽
2017 ◽
Keyword(s):
ADMISSIBILITY OF RULES OF INFERENCE, AND LOGICAL EQUATIONS, IN MODAL LOGICS AXIOMATIZING PROVABILITY
1991 ◽
Vol 36
(2)
◽
pp. 369-390
Keyword(s):