Axiomatizable Classes in Many-Sorted Logics of Programs
Wktor Danko · Fundamenta Informaticae · 1985
In this paper many-sorted logics of programs are considered (cf. Wand [16] and [3]). The aim is to characterize classes of structures axiomatizable by sets of algorithmic formulas. The results are formulated in terms of operations on classes of structures axiomatizable in the first order logic.