Abstract
The main purpose of this paper is to consider a variant of Propositional Dynamic Logic (PDL) in which the natural program concepts while do od and if then else fi are basic and in which ⌣ is the only non-deterministic program concept. Dropping ⌣ leads to the known system Strict Propositional Dynamic Logic (SPDL). The main result of this paper is that SPDL+⌣ is weaker than PDL. It is pointed out, however, that by extending SPDL+⌣ by propositional assignments a system called Propositional Program Logic (PPL) is obtained which has the same expressive power as PDL.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
