Abstract
Of the various notions of reduction in the logical literature, relative interpretability in the sense of Tarskiet al. [6] appears to be the central one. In the present note, this syntactic notion is characterized semantically, through the existence of a suitable reduction functor on models. The latter mathematical condition itself suggests a natural generalization, whose syntactic equivalent turns out to be a notion of interpretability quite close to that of Ershov [1], Szczerba [5] and Gaifman [2].
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Yu. L. Ershov,Undecidability of certain fields, (in Russian),Doklady Akademii Nauk SSSR 161 (1965), pp. 27–29.
H. Gaifman,Characterizations of uniqueness and rigidity properties, Unpublished lecture,Meeting of Model Theorists, Bedford College, 1981.
S. Kochen,Ultraproducts in the theory of models,Annals of Mathematics 74 (2) (1961), pp. 221–261.
R. Montague,Interpretability in terms of models,Indagationes Mathematicae 27 (1965), pp. 467–476.
L. W. Szczerba,Interpretability of elementary theories, in Butts and Hintikka (eds.),Logic, Foundations of Mathematics and Computability Theory, D. Reidel, Dordrecht, 1977.
A. Tarski,et. al.,Undecidable Theories, North-Holland, Amsterdam, 1953.
Author information
Authors and Affiliations
Additional information
This author's contribution was completed during a fellowship held at The Netherlands Institute for Advanced Study, 1982–3. Both authors would like to thank Wilfrid Hodges for his valuable comments and advice concerning an earlier version of this paper.
Rights and permissions
About this article
Cite this article
van Benthem, J., Pearce, D. A mathematical characterization of interpretation between theories. Stud Logica 43, 295–303 (1984). https://doi.org/10.1007/BF02429844
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02429844