On the available partial respects in which an axiomatization for real valued arithmetic can recognize its consistency

DOI10.2178/jsl/1164060451zbMath1109.03068OpenAlexW2167493425MaRDI QIDQ3416110

Dan E. Willard

Publication date: 19 January 2007

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

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

zbMATH Keywords

floating point arithmeticsecond incompleteness theoremcut-free consistency

Mathematics Subject Classification ID

First-order arithmetic and fragments (03F30)

Related Items (6)

2011 North American Annual Meeting of the Association for Symbolic Logic ⋮ Passive induction and a solution to a Paris-Wilkie open question ⋮ 2006–07 Winter Meeting of the Association for Symbolic Logic ⋮ Some specially formulated axiomizations for \(\mathrm{I}\Sigma _0\) manage to evade the Herbrandized version of the second incompleteness theorem ⋮ 2007-2008 Winter Meeting of the Association for Symbolic Logic ⋮ 2008 Annual Meeting of the Association for Symbolic Logic

Cites Work

• Unnamed Item
• Unnamed Item
• On the scheme of induction for bounded arithmetic formulas
• A generalization of the second incompleteness theorem and some exceptions to it
• Herbrand consistency and bounded arithmetic
• Cuts, consistency statements and interpretations
• Gödel's Second incompleteness theorem for Q
• Rudimentary Predicates and Relative Computation
• How to extend the semantic tableaux and cut-free versions of the second incompleteness theorem almost to Robinson's arithmetic q
• 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

This page was built for publication: On the available partial respects in which an axiomatization for real valued arithmetic can recognize its consistency