Undecidability of PDL with \(L=\{a^{2^ i}| i\geq 0\}\)

DOI10.1016/0022-0000(84)90005-9zbMath0553.03029OpenAlexW2031775313MaRDI QIDQ801901

N. E. Zubov

Publication date: 1984

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-0000(84)90005-9

zbMATH Keywords

Propositional Dynamic Logicvalidity problem

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Undecidability and degrees of sets of sentences (03D35) Abstract data types; algebraic specification (68Q65) Complexity of computation (including implicit computational complexity) (03D15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Propositional dynamic logic of nonregular programs
• An elementary proof of the completeness of PDL
• Propositional dynamic logic of regular programs
• Undecidability and nonperiodicity for tilings of the plane
• The undecidability of the domino problem

This page was built for publication: Undecidability of PDL with \(L=\{a^{2^ i}| i\geq 0\}\)