Bounded arithmetic and truth definition

DOI10.1016/0168-0072(88)90046-2zbMath0653.03038OpenAlexW1975433941MaRDI QIDQ1107528

Gaisi Takeuti

Publication date: 1988

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0168-0072(88)90046-2

zbMATH Keywords

bounded arithmeticpolynomial hierarchyGödel sentencestruth definitionsVariants of the second incompleteness theorem

Mathematics Subject Classification ID

First-order arithmetic and fragments (03F30)

Related Items (7)

On induction-free provability ⋮ Annual Meeting of the Association for Symbolic Logic, Los Angeles, 1989 ⋮ Preservation theorems and restricted consistency statements in bounded arithmetic ⋮ Exponentiation and second-order bounded arithmetic ⋮ The formalization of interpretability ⋮ \(S^ i_ 3\) and \(\overset\circ V^ i_ 2(BD)\) ⋮ Hereditarily-finite sets, data bases and polynomial-time computability

Cites Work

• On the scheme of induction for bounded arithmetic formulas

This page was built for publication: Bounded arithmetic and truth definition