The prospects and limitations of defining truth in a finite model in the sa
me language whose truth one is considering are thoroughly examined. It is s
hown that in contradistinction to Traski's undefinability theorem for arith
metic, it is in a definite sense possible in this case to define truth in t
he very language whose truth is in question.