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

Journal of Symbolic Logic 71 (4):1189-1199 (2006)
  Copy   BIBTEX

Abstract

Gödel’s Second Incompleteness Theorem states axiom systems of sufficient strength are unable to verify their own consistency. We will show that axiomatizations for a computer’s floating point arithmetic can recognize their cut-free consistency in a stronger respect than is feasible under integer arithmetics. This paper will include both new generalizations of the Second Incompleteness Theorem and techniques for evading it

Categories

Keywords

Reprint years

DOI

10.2178/jsl/1164060451

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,386

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

"True" arithmetic can prove its own consistency.Andrew Boucher -
Self-verifying axiom systems, the incompleteness theorem and related reflection principles.Dan Willard - 2001 - Journal of Symbolic Logic 66 (2):536-596.
An exploration of the partial respects in which an axiom system recognizing solely addition as a total function can verify its own consistency.Dan E. Willard - 2005 - Journal of Symbolic Logic 70 (4):1171-1209.
The consistency of arithmetic.Storrs McCall - manuscript
How to extend the semantic tableaux and cut-free versions of the second incompleteness theorem almost to Robinson's arithmetic Q.Dan E. Willard - 2002 - Journal of Symbolic Logic 67 (1):465-496.
Three theorems of Godel.Andrew Boucher - manuscript
On the Herbrand Notion of Consistency for Finitely Axiomatizable Fragments of Bounded Arithmetic Theories.Leszek Aleksander Kołodziejczyk - 2006 - Journal of Symbolic Logic 71 (2):624 - 638.
Arithmetic and Logic Incompleteness: the Link.Laureano Luna & Alex Blum - 2008 - The Reasoner 2 (3):6.
Equivalence of F with a sub-theory of peano arithmetic.Andrew Boucher - manuscript
On the philosophical relevance of Gödel's incompleteness theorems.Panu Raatikainen - 2005 - Revue Internationale de Philosophie 59 (4):513-534.
A Natural First-Order System of Arithmetic Which Proves Its Own Consistency.Andrew Boucher - manuscript
Update Procedures and the 1-Consistency of Arithmetic.Jeremy Avigad - 2002 - Mathematical Logic Quarterly 48 (1):3-13.
A consistency proof for elementary algebra and geometry.Harvey Friedman - manuscript
The Second Incompleteness Theorem and Bounded Interpretations.Albert Visser - 2012 - Studia Logica 100 (1-2):399-418.

Analytics

Added to PP
2010-08-24

Downloads
45 (#345,268)

6 months
8 (#342,364)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Passive induction and a solution to a Paris–Wilkie open question.Dan E. Willard - 2007 - Annals of Pure and Applied Logic 146 (2-3):124-149.
2007-2008 Winter Meeting of the Association for Symbolic Logic.Jeffrey Remmel - 2008 - Bulletin of Symbolic Logic 14 (3):402-411.
2006–07 Winter Meeting of the Association for Symbolic Logic.Marcia Groszek - 2007 - Bulletin of Symbolic Logic 13 (3):375-385.

Add more citations

References found in this work

On the scheme of induction for bounded arithmetic formulas.A. J. Wilkie & J. B. Paris - 1987 - Annals of Pure and Applied Logic 35 (C):261-302.
On Herbrand consistency in weak arithmetic.Zofia Adamowicz & Paweł Zbierski - 2001 - Archive for Mathematical Logic 40 (6):399-413.

Add more references