Herbrand consistency of some finite fragments of bounded arithmetical theories
A theory \(T\) is Herbrand consistent if every finite set of instances of its Skolemized form is propositionally satisfiable. The author presents a formalization of Herbrand consistency suitable for bounded arithmetic and exhibits a finite fragment of \(I\Delta_0\) whose Herbrand consistency is not provable in \(I\Delta_0\). This improves a previous result of the author that \(I\Delta_0\) does not prove a form of its own Herbrand consistency [the author, J. Symb. Log. 77, No. 3, 807--827 (2012; Zbl 1256.03065)] building on related results by \textit{Z. Adamowicz} [Fundam. Math. 171, No. 3, 279--292 (2002; Zbl 0995.03044)], \textit{D. E. Willard} [J. Symb. Log. 67, No. 1, 465--496 (2002; Zbl 1004.03050)], and \textit{L. A. Kołodziejczyk} [J. Symb. Log. 71, No. 2, 624--638 (2006; Zbl 1099.03050)].
- Separating bounded arithmetical theories by Herbrand consistency
- Herbrand consistency of some arithmetical theories
- Herbrand consistency and bounded arithmetic
- Lower and upper bounds for the provability of Herbrand consistency in weak arithmetics
- On the Herbrand notion of consistency for finitely axiomatizable fragments of bounded arithmetic theories
- Herbrand consistency and bounded arithmetic
- Herbrand consistency of some arithmetical theories
- How to extend the semantic tableaux and cut-free versions of the second incompleteness theorem almost to Robinson's arithmetic q
- scientific article; zbMATH DE number 1144041 (Why is no real title available?)
- Lower and upper bounds for the provability of Herbrand consistency in weak arithmetics
- On Herbrand consistency in weak arithmetic
- On the Herbrand notion of consistency for finitely axiomatizable fragments of bounded arithmetic theories
- Passive induction and a solution to a Paris-Wilkie open question
- Separating bounded arithmetical theories by Herbrand consistency
- Remarks on Herbrand normal forms and Herbrand realizations
- Herbrand consistency and bounded arithmetic
- Separating bounded arithmetical theories by Herbrand consistency
- Herbrand consistency of some arithmetical theories
- Lower and upper bounds for the provability of Herbrand consistency in weak arithmetics
- scientific article; zbMATH DE number 440482 (Why is no real title available?)
- Herbrandizing search problems in Bounded Arithmetic
- scientific article; zbMATH DE number 4145897 (Why is no real title available?)
- Consistency proof of a fragment of PV with substitution in bounded arithmetic
- 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 finite fragments of bounded arithmetical theories
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2377353)