Unprovability and Proving Unprovability

Studia Logica 103 (3):559-578 (2015)
  Copy   BIBTEX

Abstract

We investigate the “unprovability of unprovability”. Given a sentence P and a fixed base theory T, the unprovability of P is the sentence “\ ”. We show that the unprovability of an unprovable true sentence can be “hard to prove”

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 103,885

External links

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

Through your library

Similar books and articles

Analytics

Added to PP
2014-09-21

Downloads
48 (#499,397)

6 months
10 (#365,128)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Add more citations

References found in this work

Degrees of Relative Provability.Mingzhong Cai - 2012 - Notre Dame Journal of Formal Logic 53 (4):479-489.

Add more references