Unprovability of consistency statements in fragments of bounded arithmetic

DOI10.1016/0168-0072(94)00049-9MaRDI QIDQ1896613zbMATH OpenOpenAlexFDO

Authors Samuel R. Buss, Aleksandar Ignjatović

Publication date 31 March 1996

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(94)00049-9

zbMATH Keywords

bootstrappingbounded arithmeticinduction schemasinduction-free fragmentsunprovability of bounded consistencyweak fragments of arithmetic

Mathematics Subject Classification ID

First-order arithmetic and fragments (03F30)

Recommendations

• Consistency proof of a fragment of PV with substitution in bounded arithmetic
• scientific article; zbMATH DE number 4145897
• On the scheme of induction for bounded arithmetic formulas
• scientific article; zbMATH DE number 3880682
• scientific article; zbMATH DE number 218509

Cites work

• A note on bounded arithmetic
• scientific article; zbMATH DE number 432703 (Why is no real title available?)
• scientific article; zbMATH DE number 4066875 (Why is no real title available?)
• scientific article; zbMATH DE number 3557241 (Why is no real title available?)
• scientific article; zbMATH DE number 218509 (Why is no real title available?)

Cited in

(20)

• On the scheme of induction for bounded arithmetic formulas
• An undecidable fragment of the theory of set constraints
• A generalization of the second incompleteness theorem and some exceptions to it
• Unprovability of circuit upper bounds in Cook's theory PV
• scientific article; zbMATH DE number 3851087 (Why is no real title available?)
• scientific article; zbMATH DE number 3880682 (Why is no real title available?)
• scientific article; zbMATH DE number 4145897 (Why is no real title available?)
• Fragment of Nonstandard Analysis with a Finitary Consistency Proof
• Proving consistency of equational theories in bounded arithmetic
• Consistency proof of a fragment of PV with substitution in bounded arithmetic
• The axiom system \(\mathrm{I}\Sigma_{0}\) manages to simultaneously obey and evade the Herbrandized version of the second incompleteness theorem
• On the Herbrand notion of consistency for finitely axiomatizable fragments of bounded arithmetic theories
• An exploration of the partial respects in which an axiom system recognizing solely addition as a total function can verify its own consistency
• A model of \(\widehat{R}^2_3\) inside a subexponential time resource
• Preservation theorems and restricted consistency statements in bounded arithmetic
• On sharply bounded length induction
• On proving consistency of equational theories in bounded arithmetic
• On complexity of confluence and Church-Rosser proofs
• Some specially formulated axiomizations for \(\mathrm{I}\Sigma _0\) manage to evade the Herbrandized version of the second incompleteness theorem
• Passive induction and a solution to a Paris-Wilkie open question

This page was built for publication: Unprovability of consistency statements in fragments of bounded arithmetic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1896613)