Some specially formulated axiomizations for I _0 manage to evade the Herbrandized version of the second incompleteness theorem

DOI10.1016/J.IC.2008.11.007zbMATH Open1191.03044OpenAlexW2022687341MaRDI QIDQ731897FDOQ731897

Authors: Dan E. Willard 

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

Recommendations

• The axiom system \(\mathrm{I}\Sigma_{0}\) manages to simultaneously obey and evade the Herbrandized version of the second incompleteness theorem
• Herbrand consistency of some arithmetical theories
• On Herbrand consistency in weak arithmetic
• Herbrand consistency and bounded arithmetic
• Another look at the second incompleteness theorem

zbMATH Keywords

Herbrand consistencyGödel's second incompleteness theorem

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• On the scheme of induction for bounded arithmetic formulas
• Undecidable theories
• Arithmetization of metamathematics in a general setting
• Cuts, consistency statements and interpretations
• Title not available (Why is that?)
• Title not available (Why is that?)
• The decision problem for exponential diophantine equations
• Title not available (Why is that?)
• Solution of a problem of Leon Henkin
• Finite sets and Gödel's incompleteness theorems
• Modal analysis of generalized rosser sentences
• Title not available (Why is that?)
• Gödel's Second incompleteness theorem for Q
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• An inside view of EXP; or, The closed fragment of the provability logic of IΔ₀ + Ω₁ with a prepositional constant for EXP
• A note on proofs of falsehood
• Title not available (Why is that?)
• Existentially closed structures and Gödel's second incompleteness theorem
• Rudimentary Predicates and Relative Computation
• An exploration of the partial respects in which an axiom system recognizing solely addition as a total function can verify its own consistency
• Self-verifying axiom systems, the incompleteness theorem and related reflection principles
• Some Prime Elements in the Lattice of Interpretability Types
• The unprovability of small inconsistency. A study of local and global interpretability
• Faith \& falsity
• Unprovability of consistency statements in fragments of bounded arithmetic
• A generalization of the second incompleteness theorem and some exceptions to it
• Title not available (Why is that?)
• Herbrand consistency and bounded arithmetic
• A note on the undefinability of cuts
• Title not available (Why is that?)
• On the available partial respects in which an axiomatization for real valued arithmetic can recognize its consistency
• Title not available (Why is that?)
• 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
• Title not available (Why is that?)
• On the Herbrand notion of consistency for finitely axiomatizable fragments of bounded arithmetic theories
• Title not available (Why is that?)
• On Herbrand consistency in weak arithmetic
• Passive induction and a solution to a Paris-Wilkie open question

Cited In (3)

• 2011 North American Annual Meeting of the Association for Symbolic Logic, University of California at Berkeley, Berkeley, CA, USA, March 24--27, 2011
• The axiom system \(\mathrm{I}\Sigma_{0}\) manages to simultaneously obey and evade the Herbrandized version of the second incompleteness theorem
• Another look at the second incompleteness theorem

This page was built for publication: Some specially formulated axiomizations for \(\mathrm{I}\Sigma _0\) manage to evade the Herbrandized version of the second incompleteness theorem

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