Interpretability of Algorithmic Theories

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.