Algorithmic Logic: Różnice pomiędzy wersjami
Z Lem
| Linia 1: | Linia 1: | ||
| − | Algorithmic logic is a calculus in which one can express the semantical properties of programs and it allows to construct proofs of the formulas. In this way one can prove property correctness by proving the corresponding formula that express the property. | + | Algorithmic logic is a calculus in which one can express the semantical properties of programs and it allows to construct proofs of the formulas. In this way one can prove property like correctness by proving the corresponding formula that express the property. |
| − | == | + | == Structure of AL == |
| + | An algorithmic logic is a pair <math>\mathcal{AL} = \langle \mathcal{L}, \mathcal{C} \rangle </math>, where <math>\mathcal{L} </math> is a formalized language of algorithmic logic and | ||
== History == | == History == | ||
The origins of algorithmic logic go to papers of Yanov, H. Thiele, Erwin Engeler. | The origins of algorithmic logic go to papers of Yanov, H. Thiele, Erwin Engeler. | ||
In 1969 the program of research was formulated in the Ph.D. thesis of A. Salwicki. | In 1969 the program of research was formulated in the Ph.D. thesis of A. Salwicki. | ||
[[Category:Algorithmic Logic]] | [[Category:Algorithmic Logic]] | ||
Wersja z 10:02, 12 kwi 2014
Algorithmic logic is a calculus in which one can express the semantical properties of programs and it allows to construct proofs of the formulas. In this way one can prove property like correctness by proving the corresponding formula that express the property.
Structure of AL
An algorithmic logic is a pair [math]\mathcal{AL} = \langle \mathcal{L}, \mathcal{C} \rangle [/math], where [math]\mathcal{L} [/math] is a formalized language of algorithmic logic and
History
The origins of algorithmic logic go to papers of Yanov, H. Thiele, Erwin Engeler. In 1969 the program of research was formulated in the Ph.D. thesis of A. Salwicki.
