Algorithmic aspects of propositional tense logics

DOI10.1007/BFB0022274MaRDI QIDQ4474858zbMATH OpenFDO

Authors Valentin Shehtman, Alexander Vasil'evich Chagrov

Publication date 21 July 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BFB0022274

Mathematics Subject Classification ID

Temporal logic (03B44) Undecidability and degrees of sets of sentences (03D35) Specification and verification (program logics, model checking, etc.) (68Q60)

Cited in

(5)

• Deciding regular grammar logics with converse through first-order logic
• A note on strictly positive logics and word rewriting systems
• Kripke completeness of strictly positive modal logics over meet-semilattices with operators
• Tabularity and post-completeness in tense logic
• Pretabular tense logics over \(\mathsf{S4}_t\)

This page was built for publication: Algorithmic aspects of propositional tense logics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4474858)