Jump to content

Algorithmic logic

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Wcherowi (talk | contribs) at 03:19, 4 April 2014 (some ce). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

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.[1]Banachowski et al. (1977).

Footnotes

  1. ^ Mirkowska, Grażyna (1987). Algorithmic Logic. Warszawa & Boston: PWN & D. Reidel Publ. p. 372. ISBN 8301068590. {{cite book}}: Unknown parameter |coauthors= ignored (|author= suggested) (help)

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.
Stub icon

This mathematics-related article is a stub. You can help Wikipedia by expanding it.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Algorithmic_logic&oldid=602674440"