Completeness and decidability of tense logics closely related to logics above K4
From MaRDI portal
Publication:4338319
Recommendations
- scientific article; zbMATH DE number 759442
- scientific article; zbMATH DE number 757645
- Propositional temporal logics: decidability and completeness
- Expressiveness and completeness of an interval tense logic
- Tense logics over lattices
- scientific article; zbMATH DE number 970629
- Completeness Theorems for Temporal Logics TΩ and □TΩ
- Combined temporal and modal logic. Completeness results for predicate logic languages
- Decidability of logics based on an indeterministic metric tense logic
- scientific article; zbMATH DE number 3873295
Cites work
- A modal analog for Glivenko's theorem and its applications
- A really temporal logic
- Investigations in modal and tense logics with applications to problems in philosophy and linguistics
- Properties of independently axiomatizable bimodal logics
- Solution to a Problem of Goranko and Passy
- Tense Logic Without Tense Operators
- The finite model property in tense logic
- Using the Universal Modality: Gains and Questions
Cited in
(11)- All finitely axiomatizable tense logics of linear time flows are coNP-complete
- Tabularity and post-completeness in tense logic
- On logics with coimplication
- Tense Logic Without Tense Operators
- A useful four-valued extension of the temporal logic \(\mathsf{K}_{\mathsf t}\mathsf{T4}\)
- Combined model checking for temporal, probabilistic, and real-time logics
- Decidability of logics based on an indeterministic metric tense logic
- scientific article; zbMATH DE number 759442 (Why is no real title available?)
- The structure of lattices of subframe logics
- Canonical formulas for K4. Part II: Cofinal subframe logics
- A counterexample in tense logic
This page was built for publication: Completeness and decidability of tense logics closely related to logics above K4
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4338319)