Tense Logic Without Tense Operators

Mathematical Logic Quarterly 42 (1):145-171 (1996)
  Copy   BIBTEX

Abstract

We shall describe the set of strongly meet irreducible logics in the lattice ϵLin.t of normal tense logics of weak orderings. Based on this description it is shown that all logics in ϵLin.t are independently axiomatizable. Then the description is used in order to investigate tense logics with respect to decidability, finite axiomatizability, axiomatization problems and completeness with respect to Kripke semantics. The main tool for the investigation is a translation of bimodal formulas into a language talking about partitions of general frames into intervals so that relative to both Kripke frames and descriptive frames the expressive power of both languages coincides

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,247

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Analytics

Added to PP
2013-12-01

Downloads
38 (#592,348)

6 months
7 (#704,497)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Canonical Rules.Emil Jeřábek - 2009 - Journal of Symbolic Logic 74 (4):1171 - 1205.
Complete additivity and modal incompleteness.Wesley H. Holliday & Tadeusz Litak - 2019 - Review of Symbolic Logic 12 (3):487-535.
The structure of lattices of subframe logics.Frank Wolter - 1997 - Annals of Pure and Applied Logic 86 (1):47-100.
A Counterexample in Tense Logic.Frank Wolter - 1996 - Notre Dame Journal of Formal Logic 37 (2):167-173.

View all 11 citations / Add more citations