Abstract
An algebraic proof is given of a natural version of Craig's interpolation lemma for equational logic.
Similar content being viewed by others
References
Bergstra, J. A., Heering, J. andKlint, P.,Module algebra. Report CS-R8617, Department of Computer Science, Centre for Mathematics and Computer Science, Amsterdam (1986). Revised version: ibid. CS-R8844 (1988). To appear in Journal of the ACM.
Craig, W.,Linear reasoning. A new form of the Herbrand-Gentzen theorem, J. Symb. Log.XXII (1957), 250–268.
Grätzer, G.,Universal Algebra. Springer-Verlag, Berlin-Heidelberg-New York, 1979 (1968).
Meseguer, J. andGoguen, J. A.,Initiality, induction and computability, in: M. Nivat and J. C. Reynolds (eds.),Algebraic Methods in Semantics. University Press, Cambridge, 1985, pp. 459–541.
Pigozzi, D.,The join of equational theories, Colloquium Mathematicum XXX (1974), 15–25.
Rodenburg, P. H. andvan Glabbeek, R. J.,An interpolation theorem in equational logic. Report CS-R8838, Department of Computer Science, Centre for Mathematics and Computer Science, Amsterdam (1988).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Rodenburg, P.H. A simple algebraic proof of the equational interpolation theorem. Algebra Universalis 28, 48–51 (1991). https://doi.org/10.1007/BF01190411
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01190411