Undecidability of PDL with L=\a^2^ i| i 0\
From MaRDI portal
Publication:801901
Recommendations
Cites work
- scientific article; zbMATH DE number 3843130 (Why is no real title available?)
- scientific article; zbMATH DE number 3848600 (Why is no real title available?)
- scientific article; zbMATH DE number 3862425 (Why is no real title available?)
- scientific article; zbMATH DE number 3222108 (Why is no real title available?)
- An elementary proof of the completeness of PDL
- Propositional dynamic logic of nonregular programs
- Propositional dynamic logic of regular programs
- The undecidability of the domino problem
- Undecidability and nonperiodicity for tilings of the plane
Cited in
(6)- Exploring non-regular extensions of propositional dynamic logic with description-logics features
- scientific article; zbMATH DE number 39360 (Why is no real title available?)
- scientific article; zbMATH DE number 3862425 (Why is no real title available?)
- Deciding Properties of Nonregular Programs
- Propositional dynamic logic of nonregular programs
- Beyond \(\mathcal{ALC}_{\textsf{reg}} \): exploring non-regular extensions of PDL with description logics features
This page was built for publication: Undecidability of PDL with \(L=\{a^{2^ i}| i\geq 0\}\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q801901)