Propositional dynamic logic with local assignments
From MaRDI portal
An extension of propositional dynamic logic is proposed which allows a new kind of program terms - local assignments \(p:=v\) of truth-values v to propositional variables p. In this logic many notions, like equivalence of programs, looping and finitely branching, as well as the truth in the (standard model of) first order arithmetic are expressible. In fact it is equivalent in expressive power to first-order logic with transitive closure and its validity problem is \(\Pi^ 1_ 1\)-complete.
Recommendations
Cites work
- Definability in dynamic logic
- First-order dynamic logic
- scientific article; zbMATH DE number 3881877 (Why is no real title available?)
- scientific article; zbMATH DE number 3941493 (Why is no real title available?)
- scientific article; zbMATH DE number 3729439 (Why is no real title available?)
- Propositional dynamic logic of looping and converse is elementarily decidable
- Propositional dynamic logic of regular programs
- The axiom of choice
Cited in
(14)- Determinism and non-determinism in PDL
- Probabilistic termination versus fair termination
- Extending propositional dynamic logic for Petri nets
- A dynamic logic of institutional actions
- scientific article; zbMATH DE number 4174903 (Why is no real title available?)
- scientific article; zbMATH DE number 3845549 (Why is no real title available?)
- scientific article; zbMATH DE number 1354108 (Why is no real title available?)
- Locally determined logic programs
- Dynamic logic of propositional assignments: a well-behaved variant of PDL
- Resource separation in dynamic logic of propositional assignments
- Local fact change logic
- My writing
- An essay in combinatory dynamic logic
- Decidability of finite probabilistic propositional dynamic logics
This page was built for publication: Propositional dynamic logic with local assignments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1062972)