Some specially formulated axiomizations for \(\mathrm{I}\Sigma _0\) manage to evade the Herbrandized version of the second incompleteness theorem
From MaRDI portal
Publication:731897
DOI10.1016/j.ic.2008.11.007zbMath1191.03044OpenAlexW2022687341MaRDI QIDQ731897
Publication date: 9 October 2009
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2008.11.007
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The unprovability of small inconsistency. A study of local and global interpretability
- Faith \& falsity
- Passive induction and a solution to a Paris-Wilkie open question
- On the scheme of induction for bounded arithmetic formulas
- The decision problem for exponential diophantine equations
- Unprovability of consistency statements in fragments of bounded arithmetic
- A generalization of the second incompleteness theorem and some exceptions to it
- Undecidable theories
- Existentially closed structures and Gödel's second incompleteness theorem
- Self-verifying axiom systems, the incompleteness theorem and related reflection principles
- Herbrand consistency and bounded arithmetic
- Solution of a problem of Leon Henkin
- Arithmetization of metamathematics in a general setting
- A note on the undefinability of cuts
- Modal analysis of generalized rosser sentences
- On the available partial respects in which an axiomatization for real valued arithmetic can recognize its consistency
- Cuts, consistency statements and interpretations
- A note on proofs of falsehood
- An inside view of EXP; or, The closed fragment of the provability logic of IΔ0 + Ω1 with a prepositional constant for EXP
- Gödel's Second incompleteness theorem for Q
- Rudimentary Predicates and Relative Computation
- Gödel sentences of bounded arithmetic
- How to extend the semantic tableaux and cut-free versions of the second incompleteness theorem almost to Robinson's arithmetic q
- Finite sets and Gödel's incompleteness theorems
- Some Prime Elements in the Lattice of Interpretability Types
- 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
- On Herbrand consistency in weak arithmetic
