Algorithmic logic

Algorithmic logic is a calculus which allows the expression of semantical properties of programs by appropriate logical formulas. It provides a framework that permits proving the formulas from the axioms of program constructs such as assignment, iteration and composition instructions and from the axioms of the data structures in question see Mirkowska & Salwicki (1987), Banachowski et al. (1977).

Another logic of programs is dynamic logic, see dynamic logic, Harel, Kozen & Tiuryn (2000).

Bibliography

• Banachowski, Lech; Kreczmar, Antoni; Mirkowska, Grażyna; Rasiowa, Helena; Salwicki, Andrzej (1977). An introduction to Algorithmic Logic - Metamathematical Investigations of Theory of Programs. Banach Center Publications. Vol. 2. Warszawa: PWN. pp. 7–99.
• Mirkowska, Grażyna; Salwicki, Andrzej (1987). Algorithmic Logic. Warszawa & Boston: PWN & D. Reidel Publ. p. 372. ISBN 8301068590.
• Harel, David; Kozen, Dexter; Tiuryn, Jerzy (2000). Dynamic Logic. Cambridge Massachussets: MIT Press. p. 459.