CONSISTENCY PROOF OF A FRAGMENT OF PV WITH SUBSTITUTION IN BOUNDED ARITHMETIC

DOI10.1017/jsl.2018.14zbMath1502.03020arXiv1411.7087OpenAlexW3105759804WikidataQ129045563 ScholiaQ129045563MaRDI QIDQ4692080

Yoriyuki Yamagata

Publication date: 26 October 2018

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

Full work available at URL: https://arxiv.org/abs/1411.7087

zbMATH Keywords

computational complexitybounded arithmeticconsistency proof

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) First-order arithmetic and fragments (03F30)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Functional interpretations of feasibly constructive arithmetic
• On the scheme of induction for bounded arithmetic formulas
• Unprovability of consistency statements in fragments of bounded arithmetic
• A note on bounded arithmetic
• Proving consistency of equational theories in bounded arithmetic

This page was built for publication: CONSISTENCY PROOF OF A FRAGMENT OF PV WITH SUBSTITUTION IN BOUNDED ARITHMETIC