A Note on Equivalences Among Logics of Programs
| dc.contributor.author | Meyer, Albert R. | en_US |
| dc.contributor.author | Tiuryn, Jersey | en_US |
| dc.date.accessioned | 2023-03-29T14:20:23Z | |
| dc.date.available | 2023-03-29T14:20:23Z | |
| dc.date.issued | 1981-12 | |
| dc.identifier.uri | https://hdl.handle.net/1721.1/149022 | |
| dc.description.abstract | Several different first order formal logics of programs -- Algoritmic 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. | en_US |
| dc.relation.ispartofseries | MIT-LCS-TM-211 | |
| dc.title | A Note on Equivalences Among Logics of Programs | en_US |
| dc.identifier.oclc | 9220080 |
