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

DOI10.2307/2275736zbMATH Open0893.03005OpenAlexW2155314032MaRDI QIDQ4338319FDOQ4338319

Authors: F. Wolter 

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

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

zbMATH Keywords

completenessdecidabilitymodal logicsfinitely axiomatizableminimal tense extensionscofinal subframe logicsfinite width logics

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Decidability of theories and sets of sentences (03B25)

Cites Work

• Using the Universal Modality: Gains and Questions
• A really temporal logic
• Properties of independently axiomatizable bimodal logics
• Investigations in modal and tense logics with applications to problems in philosophy and linguistics
• Tense Logic Without Tense Operators
• A modal analog for Glivenko's theorem and its applications
• The finite model property in tense logic
• Solution to a Problem of Goranko and Passy

Cited In (11)

• Tabularity and post-completeness in tense logic
• Combined model checking for temporal, probabilistic, and real-time logics
• A counterexample in tense logic
• The structure of lattices of subframe logics
• Title not available (Why is that?)
• A useful four-valued extension of the temporal logic \(\mathsf{K}_{\mathsf t}\mathsf{T4}\)
• All finitely axiomatizable tense logics of linear time flows are coNP-complete
• Decidability of logics based on an indeterministic metric tense logic
• Tense Logic Without Tense Operators
• On logics with coimplication
• Canonical formulas for K4. Part II: Cofinal subframe logics

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)