An exploration of the partial respects in which an axiom system recognizing solely addition as a total function can verify its own consistency
From MaRDI portal
Publication:5486248
DOI10.2178/JSL/1129642122zbMATH Open1102.03055OpenAlexW2021331155WikidataQ114005173 ScholiaQ114005173MaRDI QIDQ5486248FDOQ5486248
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
Recommendations
Cites Work
- Title not available (Why is that?)
- On the scheme of induction for bounded arithmetic formulas
- Cuts, consistency statements and interpretations
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Modal analysis of generalized rosser sentences
- Title not available (Why is that?)
- Fundamenta Mathematicae: An Examination of Its Founding and Significance
- Rudimentary Predicates and Relative Computation
- Subsystems of true arithmetic and hierarchies of functions
- Relative Interpretations
- Unprovability of consistency statements in fragments of bounded arithmetic
- 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
- On Herbrand consistency in weak arithmetic
- Overspill and fragments of arithmetic
- Derivability conditions on Rosser's provability predicates
- 1 — Consistency and faithful interpretations
Cited In (14)
- 2007-2008 Winter Meeting of the Association for Symbolic Logic
- On the broader epistemological significance of self-justifying axiom systems
- 2011 North American Annual Meeting of the Association for Symbolic Logic, University of California at Berkeley, Berkeley, CA, USA, March 24--27, 2011
- Title not available (Why is that?)
- Title not available (Why is that?)
- Some specially formulated axiomizations for \(\mathrm{I}\Sigma _0\) manage to evade the Herbrandized version of the second incompleteness theorem
- Self-verifying axiom systems, the incompleteness theorem and related reflection principles
- 2008 Annual Meeting of the Association for Symbolic Logic
- Passive induction and a solution to a Paris-Wilkie open question
- The single-minded pursuit of consistency and its weakness
- The axiom system \(\mathrm{I}\Sigma_{0}\) manages to simultaneously obey and evade the Herbrandized version of the second incompleteness theorem
- A generalization of the second incompleteness theorem and some exceptions to it
- 2006 Annual Meeting of the Association for Symbolic Logic
- On the available partial respects in which an axiomatization for real valued arithmetic can recognize its consistency
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)