The Completeness of Propositional Dynamic Logic

@inproceedings{Parikh1978TheCO,
  title={The Completeness of Propositional Dynamic Logic},
  author={Rohit Parikh},
  booktitle={MFCS},
  year={1978}
}
ABSTRACT: Propositional modal logic of programs has been introduced by Fischer and Ladner [I], following ideas of Pratt [4]. We shall call it propositional dynamic logic (PDL) following the terminology of Harel, Meyer and Pratt. In the following we prove the completeness I of a rather natural set of axioms for this logic and for an extension of it obtained by allowing the inverse operation which converts a program into its inverse. The following is a brief sketch of the plan of the proof. We… CONTINUE READING
Highly Cited
This paper has 59 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.

Citations

Publications citing this paper.

60 Citations

051015'79'89'00'11
Citations per Year
Semantic Scholar estimates that this publication has 60 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-3 of 3 references

A Completeness Result for PDL,

R. Parikh
Research report, • 1978

A decidability result for a second order process logic

19th Annual Symposium on Foundations of Computer Science (sfcs 1978) • 1978

Propositional Modal Logic of Programs," Proeeeding_s9thAnnual ACMS_zmposium on Theo_rz o fCom~in~

M. J. Fischer, R. E. Ladner
1977

Similar Papers

Loading similar papers…