  Answering a question of Kaye, we show that the compositional truth theory
with a full collection scheme is conservative over Peano Arithmetic. We
demonstrate it by showing that countable models of compositional truth which
satisfy the internal induction or collection axioms can be end-extended to
models of the respective theory.
