Jump to content

Algorithmic logic

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Andrzej Salwicki (talk | contribs) at 14:48, 31 March 2014 (initiating an article). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

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

  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

  1. [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. Vol. 2 Banach Center Publications. Warszawa: PWN. p. 7-99. ISBN 123. {{cite book}}: Check |isbn= value: length (help)