We introduce a principle of local collection for compositional truth predicates and show that it is arithmetically conservative over the classically compositional theory of truth. This axiom states that upon restriction to formulae of any syntactic complexity, the resulting predicate satisfies full collection. In particular, arguments using collection for the truth predicate applied to sentences occurring in any given (code of a) proof do not suffice to show that the conclusion of that proof is true, in stark contrast to the case of the induction scheme.

We analyse various further results concerning end-extensions of models of compositional truth and the collection scheme for the compositional truth predicate.

我们介绍了组成真相谓词的本地收集原理，并表明它在经典的组成真相理论上是算术保守的。该公理指出，在限制任何语法复杂性的公式后，所得谓词将满足完整集合的要求。特别是，使用集合收集真值谓词的论点应用于出现在任何给定（a的代码）证明中的句子，这不足以表明该证明的结论是真实的，这与归纳方案的情况形成了鲜明的对比。

我们分析了有关组成真相模型的最终扩展和组成真相谓词的收集方案的各种进一步结果。