Journal of Symbolic Logic 62 (1):131-158 (1997)
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
|Keywords||No keywords specified (fix it)|
|Categories||categorize this paper)|
References found in this work BETA
Tense Logic Without Tense Operators.Frank Wolter - 1996 - Mathematical Logic Quarterly 42 (1):145-171.
A Modal Analog for Glivenko's Theorem and its Applications.V. V. Rybakov - 1992 - Notre Dame Journal of Formal Logic 33 (2):244-248.
Citations of this work BETA
Similar books and articles
Bimodal Logics for Extensions of Arithmetical Theories.Lev D. Beklemishev - 1996 - Journal of Symbolic Logic 61 (1):91-124.
On Extensions of Intermediate Logics by Strong Negation.Marcus Kracht - 1998 - Journal of Philosophical Logic 27 (1):49-73.
Completeness and Conservative Extension Results for Some Boolean Relevant Logics.Steve Giambrone & Robert K. Meyer - 1989 - Studia Logica 48 (1):1 - 14.
The Finite Model Property in Tense Logic.Frank Wolter - 1995 - Journal of Symbolic Logic 60 (3):757-774.
Completeness and Decidability Results for Some Propositional Modal Logics Containing “Actually” Operators.Dominic Gregory - 2001 - Journal of Philosophical Logic 30 (1):57-78.
Simulation and Transfer Results in Modal Logic – a Survey.Marcus Kracht & Frank Wolter - 1997 - Studia Logica 59 (2):149-177.
Added to index2009-01-28
Total downloads8 ( #484,168 of 2,153,472 )
Recent downloads (6 months)1 ( #399,080 of 2,153,472 )
How can I increase my downloads?