Completeness and Decidability of Tense Logics Closely Related to Logics Above K4

Journal of Symbolic Logic 62 (1):131-158 (1997)
  Copy   BIBTEX

Abstract

Tense logics formulated in the bimodal propositional language are investigated with respect to Kripke-completeness and decidability. It is proved that all minimal tense extensions of modal logics of finite width as well as all minimal tense extensions of cofinal subframe logics 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.

Categories

Keywords

Reprint years

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,219

External links

  • This entry has no external links. Add one.
Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Completeness and decidability of tense logics closely related to logics above K.Frank Wolter - 1997 - Journal of Symbolic Logic 62 (1):131-158.
Tense Logic Without Tense Operators.Frank Wolter - 1996 - Mathematical Logic Quarterly 42 (1):145-171.
All Finitely Axiomatizable Tense Logics of Linear Time Flows Are CoNP-complete.Tadeusz Litak & Frank Wolter - 2005 - Studia Logica 81 (2):153-165.
Simulation and transfer results in modal logic – a survey.Marcus Kracht & Frank Wolter - 1997 - Studia Logica 59 (2):149-177.
Properties of Tense Logics.Frank Wolter - 1996 - Mathematical Logic Quarterly 42 (1):481-500.
The structure of lattices of subframe logics.Frank Wolter - 1997 - Annals of Pure and Applied Logic 86 (1):47-100.
Decidability of Logics Based on an Indeterministic Metric Tense Logic.Yan Zhang & Kai Li - 2015 - Studia Logica 103 (6):1123-1162.
Completeness and decidability results for some propositional modal logics containing “actually” operators.Dominic Gregory - 2001 - Journal of Philosophical Logic 30 (1):57-78.
On the Mosaic Method for Many-Dimensional Modal Logics: A Case Study Combining Tense and Modal Operators. [REVIEW]Carlos Caleiro, Luca Viganò & Marco Volpe - 2013 - Logica Universalis 7 (1):33-69.
The finite model property in tense logic.Frank Wolter - 1995 - Journal of Symbolic Logic 60 (3):757-774.
All finitely axiomatizable subframe logics containing the provability logic CSM $_{0}$ are decidable.Frank Wolter - 1998 - Archive for Mathematical Logic 37 (3):167-182.
Cut-free sequent calculi for some tense logics.Ryo Kashima - 1994 - Studia Logica 53 (1):119 - 135.
On completeness of intermediate predicate logics with respect to {K}ripke semantics.T. Shimura - 1995 - Bulletin of the Section of Logic 24:41-45.
Kripke Completeness of Infinitary Predicate Multimodal Logics.Yoshihito Tanaka - 1999 - Notre Dame Journal of Formal Logic 40 (3):326-340.
Decidability for some justification logics with negative introspection.Thomas Studer - 2013 - Journal of Symbolic Logic 78 (2):388-402.

Analytics

Added to PP
2017-02-21

Downloads
9 (#1,187,161)

6 months
1 (#1,459,555)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

On logics with coimplication.Frank Wolter - 1998 - Journal of Philosophical Logic 27 (4):353-387.
A Counterexample in Tense Logic.Frank Wolter - 1996 - Notre Dame Journal of Formal Logic 37 (2):167-173.

Add more citations

References found in this work

No references found.

Add more references