# Algorithmic language

Skocz do: nawigacji, wyszukiwania

Language of algorithmic logic or, briefly, algorithmic language is an extension of the language of first-order logic. As usual, in order to define an algirithmic language one has to define two sets:

• the alhabet $\mathcal{A}$, i.e. the set of atomic symbols,
• the set of well formed expressions, a subset of $\mathcal{A}*$.

In fact, we shall consider a family of algorithmic languages that share some common structure. Any alphabet has these subsets:

• the set $V$ of variables,
• the set $\Phi$ of functors,
• the set of $P$ predicates (i.e. of relational symbols),
• the set of $L$ logical connectives
• the set of $S$ program connectives
• the set of auxiliary symbols, such as parentheses, semicolon, etc.