Grouping based calculus for propositional linear temporal logic

MaRDI QIDQ7022425zbMATH OpenFDO

Authors Kostas Ragauskas, Adomas Birštunas

Publication date 25 February 2025

Published in Lietuvos Matematikos Rinkinys. Proceedings of the Lithuanian Mathematical Society. Series A (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://www.journals.vu.lt/LMR/article/view/37368

zbMATH Keywords

loop checkingmarked sequentssequent calculi

Mathematics Subject Classification ID

Temporal logic (03B44)

Cites work

• Loop-free calculus for modal logic S4. I
• Method of marks for propositional linear temporal logic
• POSITIVE LOGIC WITH ADJOINT MODALITIES: PROOF THEORY, SEMANTICS, AND REASONING ABOUT INFORMATION
• Proof-search of propositional intuitionistic logic sequents by means of classical logic calculus
• PSPACE complexity of modal logic KD45\(_{n}\)
• Restrictions for loop-check in sequent calculus for temporal logic

This page was built for publication: Grouping based calculus for propositional linear temporal logic

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