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

Journal of Symbolic Logic 62 (1):131-158 (1997)
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
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.2307/2275736
Options
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history
Request removal from index
Download options
Our Archive


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 26,167
Through your library
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.

Add more references

Citations of this work BETA
On Logics with Coimplication.Frank Wolter - 1998 - Journal of Philosophical Logic 27 (4):353-387.
Technical Modal Logic.Marcus Kracht - 2011 - Philosophy Compass 6 (5):350-359.

Add more citations

Similar books and articles

Monthly downloads

Added to index

2009-01-28

Total downloads

8 ( #484,168 of 2,153,472 )

Recent downloads (6 months)

1 ( #399,080 of 2,153,472 )

How can I increase my downloads?

My notes
Sign in to use this feature


Discussion
Order:
There  are no threads in this forum
Nothing in this forum yet.

Other forums