Can There be a Proof that an Unprovable Sentence of Arithmetic is True?

&
Dialectica 43 (43):289-292 (1989)
  Copy   BIBTEX

Abstract

Various authors of logic texts are cited who either suggest or explicitly state that the Gödel incompleteness result shows that some unprovable sentence of arithmetic is true. Against this, the paper argues that the matter is one of philosophical controversy, that it is not a mathematical or logical issue.

Categories

Keywords

Reprint years

DOI

10.1111/j.1746-8361.1989.tb00945.x

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,990

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

Can There Be A Proof That Some Unprovable Arithmetic Sentence Is True?Philip Hugly & Charles Sayward - 1989 - Dialectica 43 (3):289-292.
Can There Be A Proof That Some Unprovable Arithmetic Sentence Is True?Charles Sayward Philip Hugly - 1989 - Dialectica 43 (3):289-292.
On Gödel Sentences and What They Say.Peter Milne - 2007 - Philosophia Mathematica 15 (2):193-226.
Reflections on Concrete Incompleteness.G. Longo - 2011 - Philosophia Mathematica 19 (3):255-280.
Can Gödel's Incompleteness Theorem be a Ground for Dialetheism?Seungrak Choi - 2017 - Korean Journal of Logic 20 (2):241-271.
Arithmetic Proof and Open Sentences.Neil Thompson - 2012 - Philosophy Study 2 (1):43-50.
Chaitin interview for simply gödel website.Palle Yourgrau - unknown
On constructivity and the Rosser property: a closer look at some Gödelean proofs.Saeed Salehi & Payam Seraji - 2018 - Annals of Pure and Applied Logic 169 (10):971-980.
Mathematics and the mind.Michael Redhead - 2004 - British Journal for the Philosophy of Science 55 (4):731-737.
On some much maligned remarks of Wittgenstein on gödel.Charles Sayward - 2001 - Philosophical Investigations 24 (3):262–270.

Analytics

Added to PP
2011-02-23

Downloads
39 (#398,761)

6 months
3 (#1,208,833)

Historical graph of downloads
How can I increase my downloads?

Author Profiles

Philip Hugly
University of California, Berkeley (PhD)
Charles Sayward
University of Nebraska, Lincoln

Citations of this work

No citations found.

Add more citations

References found in this work

Elementary logic.Benson Mates - 1972 - New York,: Oxford University Press.
Formal logic: its scope and limits.Richard C. Jeffrey - 1967 - Indianapolis, IN: Hackett.
Sets, Logic, and Axiomatic Theories.Alfons Borgers - 2003 - San Francisco, CA, USA: W.H. Freeman.
Introduction to symbolic logic.John L. Pollock - 1969 - New York,: Holt, Rinehart and Winston.
Understanding symbolic logic.Gerald J. Massey - 1970 - New York,: Harper & Row.

View all 6 references / Add more references