Algorithmic logic is a calculus of programs that allows the expression of

semantic properties Semantic properties or meaning properties are those aspects of a linguistic unit, such as a morpheme, word, or sentence, that contribute to the meaning of that unit. Basic semantic properties include being ''meaningful'' or ''meaningless'' – for ...

of programs by appropriate logical

formula In science, a formula is a concise way of expressing information symbolically, as in a mathematical formula or a ''chemical formula''. The informal use of the term ''formula'' in science refers to the general construct of a relationship betwee ...

s. It provides a

framework A framework is a generic term commonly referring to an essential supporting structure which other things are built on top of. Framework may refer to: Computing * Application framework, used to implement the structure of an application for an op ...

that enables proving the formulas from the

axiom An axiom, postulate, or assumption is a statement that is taken to be true, to serve as a premise or starting point for further reasoning and arguments. The word comes from the Ancient Greek word (), meaning 'that which is thought worthy or f ...

s of program constructs such as assignment, iteration and composition instructions and from the axioms of the

data structure In computer science, a data structure is a data organization, management, and storage format that is usually chosen for efficient access to data. More precisely, a data structure is a collection of data values, the relationships among them, a ...

s in question see , . The following diagram helps to locate algorithmic logic among other

logics Logic is the study of correct reasoning. It includes both formal and informal logic. Formal logic is the science of deductively valid inferences or of logical truths. It is a formal science investigating how conclusions follow from premises ...

\qquad \left begin \mathrm\\or \\ \mathrm \end\right subset  \left begin \mathrm \\or \\ \mathrm\end\right \subset \left begin\mathrm\\or \\ \mbox \end\right

The formalized language of algorithmic logic (and of algorithmic theories of various data structures) contains three types of well formed expressions: '' Terms'' - i.e. expressions denoting operations on elements of data structures, ''formulas'' - i.e. expressions denoting the relations among elements of data structures, ''programs'' - i.e.

algorithm In mathematics and computer science, an algorithm () is a finite sequence of rigorous instructions, typically used to solve a class of specific Computational problem, problems or to perform a computation. Algorithms are used as specificat ...

s - these expressions describe the computations. For semantics of terms and formulas consult pages on first-order logic and Tarski's semantics. The meaning of a program

K

is the set of possible computations of the program. Algorithmic logic is one of many logics of programs. Another logic of programs is dynamic logic, see dynamic logic, .

Bibliography

# ] # anachowski et al.br>,
# Algorithms Theoretical computer science {{mathlogic-stub