For strong arithmetizable theories T there exists a primitive recursive selector that proves every instance of the consistency schema, yielding uniformity that cannot be internalized as the single sentence Con(T).
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.LO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Uniformity of Consistency in Arithmetic and G\"odel's Second Incompleteness Theorem: Ein M\"archen
For strong arithmetizable theories T there exists a primitive recursive selector that proves every instance of the consistency schema, yielding uniformity that cannot be internalized as the single sentence Con(T).