  Ali Enayat had asked whether two halves of Disjunctive Correctness (DC) for
the compositional truth predicate are conservative over Peano Arithmetic. In
this article, we show that the principle "every true disjunction has a true
disjunct" is equivalent to bounded induction for the compositional truth
predicate and thus it is not conservative. On the other hand, the converse
implication "any disjunction with a true disjunct is true" can be
conservatively added to PA. The methods introduced here allow us to give a
direct nonconservativeness proof for DC.
