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...

Full description

Bibliographic Details
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

id	doaj-3e7209181c8f4cb0ae47b43292658f72
record_format	Article
spelling	doaj-3e7209181c8f4cb0ae47b43292658f722020-11-25T03:10:11ZengVilnius University PressLietuvos Matematikos Rinkinys0132-28182335-898X2008-12-0148proc. LMS10.15388/LMR.2008.18111Loop-free verification of termination of derivation for a fragment of dynamic logicRegimantas Pliuškevičius 0Institute of Mathematics and Informatics 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 with invertible rules is presented. https://www.journals.vu.lt/LMR/article/view/18111
collection	DOAJ
language	English
format	Article
sources	DOAJ
author	Regimantas Pliuškevičius
spellingShingle	Regimantas Pliuškevičius Loop-free verification of termination of derivation for a fragment of dynamic logic Lietuvos Matematikos Rinkinys
author_facet	Regimantas Pliuškevičius
author_sort	Regimantas Pliuškevičius
title	Loop-free verification of termination of derivation for a fragment of dynamic logic
title_short	Loop-free verification of termination of derivation for a fragment of dynamic logic
title_full	Loop-free verification of termination of derivation for a fragment of dynamic logic
title_fullStr	Loop-free verification of termination of derivation for a fragment of dynamic logic
title_full_unstemmed	Loop-free verification of termination of derivation for a fragment of dynamic logic
title_sort	loop-free verification of termination of derivation for a fragment of dynamic logic
publisher	Vilnius University Press
series	Lietuvos Matematikos Rinkinys
issn	0132-2818 2335-898X
publishDate	2008-12-01
description	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 with invertible rules is presented.
url	https://www.journals.vu.lt/LMR/article/view/18111
work_keys_str_mv	AT regimantaspliuskevicius loopfreeverificationofterminationofderivationforafragmentofdynamiclogic
_version_	1724660100193320960

Loop-free verification of termination of derivation for a fragment of dynamic logic

Similar Items