论文信息 - Completeness and decidability of tense logics closely related to logics above K4

Completeness and decidability of tense logics closely related to logics above K4

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.

Frank Wolter | F. Wolter

[1] Bjarni Jónsson,et al. A Survey of Boolean Algebras with Operators , 1993 .

[2] Marcus Kracht,et al. Properties of independently axiomatizable bimodal logics , 1991, Journal of Symbolic Logic.

[3] Frank Wolter,et al. Tense Logic Without Tense Operators , 1996, Math. Log. Q..

[4] Alasdair Urquhart,et al. Temporal Logic , 1971 .

[5] Johan van Benthem,et al. The Logic of Time , 1983 .

[6] W. Blok. Varieties of interior algebras , 1976 .

[7] R. Goldblatt. Metamathematics of modal logic , 1974, Bulletin of the Australian Mathematical Society.

[8] Vladimir V. Rybakov. A Modal Analog for Glivenko's Theorem and its Applications , 1992, Notre Dame J. Formal Log..

[9] R. Goldblatt. Logics of Time and Computation , 1987 .

[10] Frank Wolter,et al. Solution to a Problem of Goranko and Passy , 1994, J. Log. Comput..

[11] Valentin Goranko,et al. Using the Universal Modality: Gains and Questions , 1992, J. Log. Comput..

[12] Frank Wolter,et al. A Counterexample in Tense Logic , 1996, Notre Dame J. Formal Log..

[13] John P. Burgess,et al. Basic Tense Logic , 1984 .

[14] Dov M. Gabbay,et al. Investigations in modal and tense logics with applications to problems in philosophy and linguistics , 1976 .