Completeness and decidability of tense logics closely related to logics above K4
From MaRDI portal
Publication:4338319
DOI10.2307/2275736zbMath0893.03005OpenAlexW2155314032MaRDI QIDQ4338319
Publication date: 20 July 1998
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2275736
completenessdecidabilitymodal logicsfinitely axiomatizableminimal tense extensionscofinal subframe logicsfinite width logics
Modal logic (including the logic of norms) (03B45) Decidability of theories and sets of sentences (03B25)
Related Items (5)
The structure of lattices of subframe logics ⋮ Combined model checking for temporal, probabilistic, and real-time logics ⋮ Tense Logic Without Tense Operators ⋮ A counterexample in tense logic ⋮ On logics with coimplication
Cites Work
- A modal analog for Glivenko's theorem and its applications
- Investigations in modal and tense logics with applications to problems in philosophy and linguistics
- Properties of independently axiomatizable bimodal logics
- Using the Universal Modality: Gains and Questions
- Solution to a Problem of Goranko and Passy
- A really temporal logic
- The finite model property in tense logic
- Tense Logic Without Tense Operators
This page was built for publication: Completeness and decidability of tense logics closely related to logics above K4
