  We investigate abstract model theoretic properties which holds for models in
which a truth or satisfaction predicate for a sublanguage of the signature is
definable. We analyse in which cases those properties in fact ensure the
definability of the respective truth predicate. In some cases, we formulate
different axiomatic theories which are indispensable for such properties to
hold and we analyse the mutual definability relations between those theories.
