Socrates did it before Gödel

Logic and Logical Philosophy 20 (3):205-214 (2011)
  Copy   BIBTEX

Abstract

We translate Socrates’ famous saying I know that I know nothing into the arithmetical sentence I prove that I prove nothing. Then it is easy to show that this translated saying is formally undecidable in formal arithmetic, using Gödel’s Second Incompleteness Theorem. We investigate some variations of this Socrates-Gödel sentence. In an appendix we sketch a ramified epistemic logic with propositional quantifiers in order to analyze the Socrates-Gödel sentence in a more logical way, separated from the arithmetical context

Other Versions

No versions found

Links

PhilArchive

    This entry is not archived by us. If you are the author and have permission from the publisher, we recommend that you archive it. Many publishers automatically grant permission to authors to archive pre-prints. By uploading a copy of your work, you will enable us to better index it, making it easier to find.

    Upload a copy of this work     Papers currently archived: 102,873

External links

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

Through your library

Analytics

Added to PP
2013-11-24

Downloads
59 (#372,679)

6 months
14 (#206,705)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

The incompleteness theorems.Craig Smorynski - 1977 - In Jon Barwise, Handbook of mathematical logic. New York: North-Holland. pp. 821 -- 865.
[Omnibus Review].C. Smorynski - 1979 - Journal of Symbolic Logic 44 (1):116-119.

Add more references