Loop-free verification of termination of derivation for a fragment of dynamic logic
A fragment of a deterministic propositional dynamic logic (DPDL, in short) is considered The language of considered fragment contains propositional symbols, action constants, action operator (repetition) and logical symbols. For safety fragment of considered DPDL a loop-check-free sequent calculus w...
Main Author: | Regimantas Pliuškevičius |
---|---|
Format: | Article |
Language: | English |
Published: |
Vilnius University Press
2008-12-01
|
Series: | Lietuvos Matematikos Rinkinys |
Online Access: | https://www.journals.vu.lt/LMR/article/view/18111 |
Similar Items
-
Termination of derivations for minimal tense logic
by: Regimantas Pliuškevičius
Published: (2009-12-01) -
Decision procedures for quantified fragments of reflexive common knowledge logic
by: Regimantas Pliuškevičius
Published: (2004-12-01) -
Combination of temporal logic with modal logic KD
by: Regimantas Pliuškevičius
Published: (2003-12-01) -
Contraction-free calculi for modal logics S5 and KD45
by: Julius Andrikonis, et al.
Published: (2011-12-01) -
Cut, invariant rule, and loop-check free sequent calculus for PLTL
by: Romas Alonderis, et al.
Published: (2011-12-01)