TRUTH AND FEASIBLE REDUCIBILITY
Keyword(s):
Speed Up
◽
AbstractLet ${\cal T}$ be any of the three canonical truth theories CT− (compositional truth without extra induction), FS− (Friedman–Sheard truth without extra induction), or KF− (Kripke–Feferman truth without extra induction), where the base theory of ${\cal T}$ is PA (Peano arithmetic). We establish the following theorem, which implies that ${\cal T}$ has no more than polynomial speed-up over PA.Theorem.${\cal T}$is feasibly reducible to PA, in the sense that there is a polynomial time computable function f such that for every${\cal T}$-proof π of an arithmetical sentence ϕ, f (π) is a PA-proof of ϕ.
2017 ◽
Vol 10
(3)
◽
pp. 455-480
◽
Keyword(s):
Keyword(s):
Keyword(s):
1989 ◽
Vol 115
◽
pp. 165-183
◽
Keyword(s):
Keyword(s):