Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: The borderline beten decidable and undecidable Propositional Dynamic Logic (PDL) is sought when iterative programs represented by regular expressions are augmented with increasingly more complex recursive programs represented by context-free languages. The results in this paper and its companion [HPS] indicate that this line is extremely close to the original regular PDL. The main result of the present paper is: The validity problem for PDL with additional programs αΔ(β)γΔ for regular α, β and γ, defined as Uiαi; β; γi, is Π11-complete. One of the results of [HPS] shows that the single program AΔ(B) AΔ for atomic A and B is actually sufficient for obtaining Π11- completeness. Hover, the proofs of this paper use different techniques which seem to be worthwhile in their own right.
['David Harel', 'Amir Pnueli', 'Jonathan Stavi']
I am writing a research paper on a idea Propositional dynamic logic of context-free programs
[{"from": "human", "value": "I am writing a research paper on a idea Propositional dynamic logic of context-free programs"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: The borderline beten decidable and undecidable Propositional Dynamic Logic (PDL) is sought when iterative programs represented by regular expressions are augmented with increasingly more complex recursive programs represented by context-free languages. The results in this paper and its companion [HPS] indicate that this line is extremely close to the original regular PDL. The main result of the present paper is: The validity problem for PDL with additional programs \u03b1\u0394(\u03b2)\u03b3\u0394 for regular \u03b1, \u03b2 and \u03b3, defined as Ui\u03b1i; \u03b2; \u03b3i, is \u03a011-complete. One of the results of [HPS] shows that the single program A\u0394(B) A\u0394 for atomic A and B is actually sufficient for obtaining \u03a011- completeness. Hover, the proofs of this paper use different techniques which seem to be worthwhile in their own right."}]