Axiomatization and computability of a variant of iteration-free PDL with fork

DOI10.1007/978-3-319-73579-5_2zbMath1499.03022OpenAlexW2782392986MaRDI QIDQ5915994

Philippe Balbiani, Joseph Boudou

Publication date: 12 April 2018

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://oatao.univ-toulouse.fr/22291/1/balbiani_22291.pdf

zbMATH Keywords

computabilityaxiomatizationforkiteration-free PDL

Mathematics Subject Classification ID

Logic in computer science (03B70) Decidability of theories and sets of sentences (03B25)

This page was built for publication: Axiomatization and computability of a variant of iteration-free PDL with fork