Interpretability of Algorithmic Theories

Article type: Research Article

Authors: Dańko, Wiktor

Affiliations: University of Warsaw, Białystok Division

Abstract: In this paper we consider interpretability between algorithmic theories, i.e., formalized theories based on the algorithmic Logic (cf. [1,3]). We adopt the notion of interpretability proposed by Szczerba (cf. [7,8]). We show that some facts true in the case of interpretability of first order theories are also true in the case of interpretability of algorithmic theories. We give examples of hereditary and nonhereditary properties of interpretability of algorithmic theories.

Keywords: logics of programs, algorithmic logic, interpretability between formalized theories

DOI: 10.3233/FI-1983-6205

Journal: Fundamenta Informaticae, vol. 6, no. 2, pp. 217-233, 1983