Herbrand consistency of some arithmetical theories

DOI10.2178/JSL/1344862163zbMath1256.03065arXiv1005.2654OpenAlexW1591524845WikidataQ57533047 ScholiaQ57533047MaRDI QIDQ2915894

Saeed Salehi

Publication date: 19 September 2012

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

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

zbMATH Keywords

weak arithmeticsGödel's second incompleteness theoremHerbrand consistencybounded arithmeticscut-free provabilityHerbrand provability

Mathematics Subject Classification ID

Gödel numberings and issues of incompleteness (03F40)

Related Items (1)

Herbrand consistency of some finite fragments of bounded arithmetical theories

Cites Work

• Unnamed Item
• Unnamed Item
• Passive induction and a solution to a Paris-Wilkie open question
• Herbrand consistency and bounded arithmetic
• Separating bounded arithmetical theories by Herbrand consistency
• Lower and upper bounds for the provability of Herbrand consistency in weak arithmetics
• Cuts, consistency statements and interpretations
• How to extend the semantic tableaux and cut-free versions of the second incompleteness theorem almost to Robinson's arithmetic q
• On the Herbrand notion of consistency for finitely axiomatizable fragments of bounded arithmetic theories
• On Herbrand consistency in weak arithmetic

This page was built for publication: Herbrand consistency of some arithmetical theories