Abstract

After an introduction which demonstrates the failure of the equational analogue of Beth?s definability theorem, the first two sections of this paper are devoted to an elementary exposition of a proof that a functional constant is equationally definable in an equational theory iff every model of the set of those consequences of the theory that do not contain the functional constant is uniquely extendible to a model of the theory itself.Sections three, four and five are devoted to applications and extensions of this result.Topics considered here include equational definability in first order logic, an extended notion of definability in equational logic and the synonymy of equational theories.The final two sections briefly review some of the history of equational logic