Undecidability of PDL with L=\a^2^ i| i 0\

DOI10.1016/0022-0000(84)90005-9zbMATH Open0553.03029OpenAlexW2031775313MaRDI QIDQ801901FDOQ801901

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

Recommendations

• Propositional dynamic logic of nonregular programs
• Deciding Properties of Nonregular Programs
• PDL with data constants
• More on nonregular PDL: Finite models and Fibonacci-like programs
• scientific article; zbMATH DE number 3862425

zbMATH Keywords

Propositional Dynamic Logicvalidity problem

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Propositional dynamic logic of regular programs
• The undecidability of the domino problem
• Undecidability and nonperiodicity for tilings of the plane
• Propositional dynamic logic of nonregular programs
• An elementary proof of the completeness of PDL
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (6)

• Exploring non-regular extensions of propositional dynamic logic with description-logics features
• Title not available (Why is that?)
• Title not available (Why is that?)
• 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)