Abstract
Several different first order formal logics of programs— Algorithmic Logic, Dynamic Logic, and Logic of Effective Definitions — are compared and shown to be equivalent to a fragment of constructive Lω1ω. When programs are modelled as effective flowcharts, the logics of deterministic and nondeterministic programs are equivalent.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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 call
