Algorithmic logic
Algorithmic logic is a calculus which allow to express semantical properties of programs by appropriate logical formulas, and to prove the formulas from axioms of program constructs such as assignment, iteration and composition instructions and from axioms of data structures in question[1][[[:Template:Odn]]].
Footnotes
- ^ 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 i in.] 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. PWN. pp. 7–99. ISBN 123.
{{cite book}}: Check|isbn=value: length (help); Unknown parameter|miejsce=ignored (|location=suggested) (help); Unknown parameter|odn=ignored (help); Unknown parameter|tom=ignored (help); Unknown parameter|tome=ignored (help)
 | This article has not been added to any content categories. Please help out by adding categories to it so that it can be listed with similar articles, in addition to a stub category. (April 2014) |
 | This mathematics-related article is a stub. You can help Wikipedia by expanding it. |