Algorithmic Logic: Różnice pomiędzy wersjami
(→Structure of AL) |
|||
| Linia 2: | Linia 2: | ||
== Structure of AL == | == 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 <math>\mathcal{C} </math> is i a logical consequence operation defined by the notions of logical axioms, inference rules and the notion of (formal) proof. | 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 <math>\mathcal{C} </math> is i a logical consequence operation defined by the notions of logical axioms, inference rules and the notion of (formal) proof. | ||
| − | + | An algorithmic language <math>\mathcal{L} </math> is a pair consisting of the alphabet of <math>\mathcal{L} </math> and the set of weel-formed expressions, <math>\mathcal{L} = \langle A, WFF \rangle </math>, where <math> A </math> is the alphabet, i.e. the set of admissible symbols and <math> WFF </math> is the set of well formed expressions of the language. | |
== History == | == History == | ||
Wersja z 09:14, 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 [math]\mathcal{C} [/math] is i a logical consequence operation defined by the notions of logical axioms, inference rules and the notion of (formal) proof. An algorithmic language [math]\mathcal{L} [/math] is a pair consisting of the alphabet of [math]\mathcal{L} [/math] and the set of weel-formed expressions, [math]\mathcal{L} = \langle A, WFF \rangle [/math], where [math] A [/math] is the alphabet, i.e. the set of admissible symbols and [math] WFF [/math] is the set of well formed expressions of the language.
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.
