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

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”
Keywords Unprovability  Provability degrees
Categories (categorize this paper)
DOI 10.1007/s11225-014-9579-7
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

Our Archive

Upload a copy of this paper     Check publisher's policy     Papers currently archived: 50,308
External links

Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library

References found in this work BETA

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

Add more references

Citations of this work BETA

Add more citations

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 index

Total views
22 ( #441,960 of 2,326,001 )

Recent downloads (6 months)
3 ( #293,124 of 2,326,001 )

How can I increase my downloads?


My notes