Elimination of loop-check for logic of idealized knowledge

Aida Pliuškevičienė

doi:10.15388/LMR.2009.46

Articles

Aida Pliuškevičienė

Institute of Mathematics and Informatics

Published 2009-12-20

https://doi.org/10.15388/LMR.2009.46

PDF

Keywords

modal logics
sequent calculus
termination of derivation
loop-check
indexation

How to Cite

Pliuškevičienė, A. (2009) “Elimination of loop-check for logic of idealized knowledge”, Lietuvos matematikos rinkinys, 50(proc. LMS), pp. 258–263. doi:10.15388/LMR.2009.46.

Download Citation

Abstract

In the paper loop-check-free sequent calculus for logic of idealized knowledge is presented. To obtain termination of derivation indices and marks are used instead of history.

PDF

Downloads

Most read articles by the same author(s)

Romas Alonderis, Regimantas Pliuškevičius, Aida Pliuškevičienė, Finite sequent calculi for PLTL , Lietuvos matematikos rinkinys: Vol. 56 (2015): Ser. A
Regimantas Pliuškevičius , Aida Pliuškevičienė, A method of marks and indices for linear modal logic , Lietuvos matematikos rinkinys: Vol. 50 (2009)
Aida Pliuškevičienė, Loop-check elimination for non-transitive distributed knowledge logic , Lietuvos matematikos rinkinys: Vol. 48 (2008)
Aida Pliuškevičienė, Specialization of derivations in modal logic S5 , Lietuvos matematikos rinkinys: Vol. 46 (2006)
Aida Pliuškevičienė, Decision procedure for an extended miniscoped fragment of FTL with equality , Lietuvos matematikos rinkinys: Vol. 43 (2003)
Aida Pliuškevičienė, Decision procedure for a combination of logics KD4 and PDL , Lietuvos matematikos rinkinys: Vol. 44 (2004)
Aida Pliuškevičienė, Decision procedure for a fragment of quantified branching temporal logic , Lietuvos matematikos rinkinys: Vol. 42 (2002)
Aida Pliuškevičienė, Decision procedure for a fragment of dynamic logic , Lietuvos matematikos rinkinys: Vol. 41 (2001)