当前位置:
X-MOL 学术
›
J. Symb. Log.
›
论文详情
Our official English website, www.x-mol.net, welcomes your
feedback! (Note: you will need to create a separate account there.)
TRUTH AND FEASIBLE REDUCIBILITY
The Journal of Symbolic Logic ( IF 0.5 ) Pub Date : 2019-09-20 , DOI: 10.1017/jsl.2019.24 Ali Enayat , Mateusz Łełyk , Bartosz Wcisło
The Journal of Symbolic Logic ( IF 0.5 ) Pub Date : 2019-09-20 , DOI: 10.1017/jsl.2019.24 Ali Enayat , Mateusz Łełyk , Bartosz Wcisło
Let ${\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 ϕ .
中文翻译:
真实性和可简化性
让${\cal T}$ 是三个典型真理论 CT 中的任何一个- (没有额外归纳的组成真理),FS- (弗里德曼——没有额外归纳的谢德真理),或 KF- (没有额外归纳的 Kripke-Feferman 真),其中${\cal T}$ 是 PA(皮亚诺算术)。我们建立以下定理,这意味着${\cal T}$ 对 PA 的加速不超过多项式。定理。 ${\cal T}$ 可以简化为 巴勒斯坦权力机构,从某种意义上说,有一个多项式时间可计算函数 f 使得对于每个 ${\cal T}$ -算术句子 φ 的证明 π ,F (π )是一个 功放- 证明 .
更新日期:2019-09-20
中文翻译:
真实性和可简化性
让