A labeled sequent calculus for propositional linear time logic

Romas Alonderis

doi:10.15388/LMR.A.2012.01

Articles

Romas Alonderis

Vilnius University

Published 2012-12-15

https://doi.org/10.15388/LMR.A.2012.01

PDF

Keywords

labeled sequent calculus
temporal logic

How to Cite

Alonderis R. (2012) “A labeled sequent calculus for propositional linear time logic”, Lietuvos matematikos rinkinys, 53(A), pp. 1–6. doi: 10.15388/LMR.A.2012.01.

Abstract

A labeled sequent calculus LSC for propositional linear discrete time logic PLTL is introduced. Its sub-calculus LSC⁻_TL is proved to be complete for some class of PLTL sequents.

PDF

This work is licensed under a Creative Commons Attribution 4.0 International License.

Please read the Copyright Notice in Journal Policy.

Downloads

Article Views | PDF Downloads

Range Graph | Chart Graph

Most read articles by the same author(s)

Romas Alonderis, Regimantas Pliuškevičius, Sequent systems for PLTL , Lietuvos matematikos rinkinys: Vol 54 (2013): Ser. A
Romas Alonderis, Regimantas Pliuškevičius, Aida Pliuškevičienė, Finite sequent calculi for PLTL , Lietuvos matematikos rinkinys: Vol 56 (2015): Ser. A
Romas Alonderis, Haroldas Giedra, A derivation-loop method for temporal logic , Lietuvos matematikos rinkinys: Vol 60 (2019): Ser. A
Romas Alonderis, Brodsky’s coding method for propositional logic , Lietuvos matematikos rinkinys: Vol 58 (2017): Ser. A
Haroldas Giedra, Romas Alonderis, Applications of logic of correlated knowledge to quantum mechanics , Lietuvos matematikos rinkinys: Vol 59 (2018): Ser. A
Romas Alonderis, A sequent calculus for propositional temporal logic with time gaps , Lietuvos matematikos rinkinys: Vol 52 (2011)
Romas Alonderis, Regimantas Pliuškevičius, Cut, invariant rule, and loop-check free sequent calculus for PLTL , Lietuvos matematikos rinkinys: Vol 52 (2011)