Abstract
We investigate the “unprovability of unprovability”. Given a sentence P and a fixed base theory T, the unprovability of P is the sentence “\({T\nvdash P}\) ”. We show that the unprovability of an unprovable true sentence can be “hard to prove”.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Andrews, U., M. Cai, D. Diamondstone, S. Lempp, and J. S. Miller, On the structure of the degrees of relative provability, To appear in Israel Journal of Mathematics
Beklemishev, L., Personal communication.
Cai M.: Degrees of relative provability. Notre Dame Journal of Formal Logic 53(4), 479–489 (2012)
Shore R.A., Slaman T.A.: Defining the Turing jump. Mathematical Research Letters 6, 711–722 (1999)
Smorynski, C., The Incompleteness Theorems, in J. Barwise (eds.), Handbook of Mathematical Logic, North Holland Publishing Company, Amsterdam, 1989, pp. 821–865.
Author information
Authors and Affiliations
Corresponding author
Additional information
Presented by Constantine Tsinakis
Rights and permissions
About this article
Cite this article
Cai, M. Unprovability and Proving Unprovability. Stud Logica 103, 559–578 (2015). https://doi.org/10.1007/s11225-014-9579-7
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11225-014-9579-7