A Note on Equivalences Among Logics of Programs
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 nondeterm...
Main Authors: | Meyer, Albert R., Tiuryn, Jersey |
---|---|
Published: |
2023
|
Online Access: | https://hdl.handle.net/1721.1/149022 |
Similar Items
-
A Survey of the Logic of Effective Definitions
by: Tiuryn, J.
Published: (2023) -
Hoare's Logic Is Not Complete When It Could Be
by: Bergstra, J., et al.
Published: (2023) -
Ten Thousand and One Logics of Programming
by: Meyer, Albert R.
Published: (2023) -
Computability and Completeness in Logics of Programs
by: Harel, David, et al.
Published: (2023) -
Asymmetric Equivalences in Fuzzy Logic
by: Bo Hu, et al.
Published: (2017-10-01)