Iteration-free PDL with storing, recovering and parallel composition: a complete axiomatization

DOI10.1093/LOGCOM/EXV035zbMath1444.03109OpenAlexW2589327496MaRDI QIDQ4612423

Philippe Balbiani, Joseph Boudou

Publication date: 31 January 2019

Published in: Journal of Logic and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/logcom/exv035

zbMATH Keywords

completenessexpressivityaxiomatisationparallel compositioniteration-free PDL

Mathematics Subject Classification ID

Logic in computer science (03B70)

Related Items (4)

Tableaux Methods for Propositional Dynamic Logics with Separating Parallel Composition ⋮ Exponential-Size Model Property for PDL with Separating Parallel Composition ⋮ Resource separation in dynamic logic of propositional assignments ⋮ Axiomatization and computability of a variant of iteration-free PDL with fork

This page was built for publication: Iteration-free PDL with storing, recovering and parallel composition: a complete axiomatization