This paper combines propositional dynamic logic (\({\textsf {PDL}}\)) with propositional inquisitive logic (\(\textsf {InqB}\)). The result of this combination is a logical system \(\textsf {InqPDL}\) that conservatively extends both \({\textsf {PDL}}\) and \(\textsf {InqB}\), and, moreover, allows for an interaction of the question-forming operator from \(\textsf {InqB}\) with the structured modalities from \({\textsf {PDL}}\). We study this system from a semantic as well as a syntactic point of view. These two perspectives are linked via a completeness proof, which also shows that \(\textsf {InqPDL}\) is decidable.

本文将命题动态逻辑（\（{\ textsf {PDL}} \））和命题质询逻辑（\（\ textsf {InqB} \））结合在一起。这种组合的结果是一个逻辑系统\（\ textsf {InqPDL} \）保守地扩展了\（{\ textsf {PDL}} \）和\（\ textsf {InqB} \），并且允许\（\ textsf {InqB} \）的问题形成运算符与\（{\ textsf {PDL}} \）的结构化模式的交互。我们从语义和句法的角度研究此系统。这两个观点通过完整性证明链接在一起，该证明还表明\（\ textsf {InqPDL} \）是可判定的。