Answers are grounded in this paper and cite their sources.
The uniform reflection principle for the theory of uniform T-sentences is added to PA. The resulting system is justified on the basis of a disquotationalist theory of truth where the provability predicate is conceived as a special kind of analyticity. The system is equivalent to the system ACA of arithmetical comprehension. If the truth predicate is also allowed to occur in the sentences that are inserted in the T-sentences. yet not in the scope of negation, the system with the reflection schema for these T-sentences assumes the strength of the Kripke-Feferman theory KF. and thus of ramified analysis up to ε0.
No takes yet. Share an insight, caveat, or question.
Volker Halbach (2001) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: