The double-incompleteness theorem
Date
1976
Authors
Podnieks, Karlis
Journal Title
Journal ISSN
Volume Title
Publisher
Stiinca, Kishinev
Abstract
Let T be a strong enough theory, and M - its metatheory, both are consistent. Then there is a closed arithmetical formula H that is undecidable in T, but one cannot prove in M neither that H is T-unprovable, nor that H is T-unrefutable.
For English translation and proof, see K. Podnieks What is mathematics: Godel's theorem and around.
Description
Keywords
double incompleteness , incompleteness , incompleteness theorem
Citation
Karlis Podnieks. The double-incompleteness theorem. Proceedings of Fourth All-Union Conference on Mathematical Logic, 1976, Stiinca, Kishinev, p.118 (in Russian)