An exploration of the partial respects in which an axiom system recognizing solely addition as a total function can verify its own consistency

DOI10.2178/JSL/1129642122MaRDI QIDQ5486248zbMATH OpenOpenAlexWikidataFDO

Authors Dan E. Willard

Publication date 6 September 2006

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

Full work available at URL https://doi.org/10.2178/jsl/1129642122

zbMATH Keywords

consistencydeduction systems

Mathematics Subject Classification ID

Relative consistency and interpretations (03F25)

Recommendations

• Self-verifying axiom systems, the incompleteness theorem and related reflection principles
• scientific article; zbMATH DE number 517088
• Automated Reasoning with Analytic Tableaux and Related Methods
• scientific article; zbMATH DE number 1088209
• scientific article; zbMATH DE number 1950268

Cites work

• scientific article; zbMATH DE number 46359 (Why is no real title available?)
• scientific article; zbMATH DE number 51556 (Why is no real title available?)
• scientific article; zbMATH DE number 3999883 (Why is no real title available?)
• scientific article; zbMATH DE number 819737 (Why is no real title available?)
• scientific article; zbMATH DE number 3274715 (Why is no real title available?)
• 1 — Consistency and faithful interpretations
• Cuts, consistency statements and interpretations
• Derivability conditions on Rosser's provability predicates
• Fundamenta Mathematicae: An Examination of Its Founding and Significance
• Herbrand consistency and bounded arithmetic
• How to extend the semantic tableaux and cut-free versions of the second incompleteness theorem almost to Robinson's arithmetic q
• Modal analysis of generalized rosser sentences
• On Herbrand consistency in weak arithmetic
• On the scheme of induction for bounded arithmetic formulas
• Overspill and fragments of arithmetic
• Relative Interpretations
• Rudimentary Predicates and Relative Computation
• Subsystems of true arithmetic and hierarchies of functions
• Unprovability of consistency statements in fragments of bounded arithmetic

Cited in

(14)

• 2007-2008 Winter Meeting of the Association for Symbolic Logic
• The single-minded pursuit of consistency and its weakness
• Self-verifying axiom systems, the incompleteness theorem and related reflection principles
• On the broader epistemological significance of self-justifying axiom systems
• A generalization of the second incompleteness theorem and some exceptions to it
• The axiom system \(\mathrm{I}\Sigma_{0}\) manages to simultaneously obey and evade the Herbrandized version of the second incompleteness theorem
• 2006 Annual Meeting of the Association for Symbolic Logic
• 2011 North American Annual Meeting of the Association for Symbolic Logic, University of California at Berkeley, Berkeley, CA, USA, March 24--27, 2011
• On the available partial respects in which an axiomatization for real valued arithmetic can recognize its consistency
• Some specially formulated axiomizations for \(\mathrm{I}\Sigma _0\) manage to evade the Herbrandized version of the second incompleteness theorem
• 2008 Annual Meeting of the Association for Symbolic Logic
• Passive induction and a solution to a Paris-Wilkie open question
• scientific article; zbMATH DE number 5000992 (Why is no real title available?)
• scientific article; zbMATH DE number 517088 (Why is no real title available?)

This page was built for publication: An exploration of the partial respects in which an axiom system recognizing solely addition as a total function can verify its own consistency

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