Unprovability and Proving Unprovability

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


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”



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

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

Proving unprovability in some normal modal logics.Valentin Goranko - 1991 - Bulletin of the Section of Logic 20 (1):23-29.
A Note on Unprovability-Preserving Sound Translations.Takao Inoue - 1990 - Logique Et Analyse 33 (31):243-257.
Unprovability threshold for the planar graph minor theorem.Andrey Bovykin - 2010 - Annals of Pure and Applied Logic 162 (3):175-181.
The unprovability of small inconsistency.Albert Visser - 1993 - Archive for Mathematical Logic 32 (4):275-298.


Added to PP

31 (#484,163)

6 months
1 (#1,428,112)

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