Gödel sentences of bounded arithmetic

DOI10.2307/2586703zbMath1075.03029OpenAlexW2053394237MaRDI QIDQ4527927

Gaisi Takeuti

Publication date: 2000

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2586703

zbMATH Keywords

complexity classesGödel sentencesBounded Arithmetic

Mathematics Subject Classification ID

First-order arithmetic and fragments (03F30) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (4)

Passive induction and a solution to a Paris-Wilkie open question ⋮ The Axiom System IΣ0 Manages to Simultaneously Obey and Evade the Herbrandized Version of the Second Incompleteness Theorem ⋮ A generalization of the second incompleteness theorem and some exceptions to it ⋮ Some specially formulated axiomizations for \(\mathrm{I}\Sigma _0\) manage to evade the Herbrandized version of the second incompleteness theorem

This page was built for publication: Gödel sentences of bounded arithmetic