Beth’s Definability Theorem
Raymond Smullyan · 2008
An important application of Craig’s Interpolation Lemma is that it provides a particularly neat proof of an important result, called Definability Theorem, by the Dutch logician Evert Beth. This chapter considers a finite set of sentences without parameters and involving only unary predicates. There is a notion of definability, called implicit definability.