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

DOI10.1093/LOGCOM/EXV035zbMATH Open1444.03109OpenAlexW2589327496MaRDI QIDQ4612423FDOQ4612423

Authors: 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

Recommendations

• Axiomatization and computability of a variant of iteration-free PDL with fork
• Iteration-free PDL with intersection: A complete axiomatization
• scientific article; zbMATH DE number 2066186
• A canonical model construction for iteration-free PDL with intersection
• Propositional dynamic logic with storing, recovering and parallel composition

zbMATH Keywords

completenessexpressivityaxiomatisationparallel compositioniteration-free PDL

Mathematics Subject Classification ID

Logic in computer science (03B70)

Cited In (11)

• Title not available (Why is that?)
• Exponential-size model property for PDL with separating parallel composition
• Tableaux methods for propositional dynamic logics with separating parallel composition
• Strong completeness for iteration-free coalgebraic dynamic logics
• Title not available (Why is that?)
• Resource separation in dynamic logic of propositional assignments
• Axiomatization and computability of a variant of iteration-free PDL with fork
• Propositional dynamic logic with storing, recovering and parallel composition
• Iteration-free PDL with intersection: A complete axiomatization
• A canonical model construction for iteration-free PDL with intersection
• PDL with intersection of programs: a complete axiomatization

This page was built for publication: Iteration-free \(\mathrm{PDL}\) with storing, recovering and parallel composition: a complete axiomatization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4612423)