The double-incompleteness theorem
| dc.contributor.author | Podnieks, Karlis | |
| dc.date.accessioned | 2013-08-01T08:45:06Z | |
| dc.date.available | 2013-08-02T00:00:03Z | |
| dc.date.issued | 1976 | |
| dc.description.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. | en_US |
| dc.identifier.citation | Karlis Podnieks. The double-incompleteness theorem. Proceedings of Fourth All-Union Conference on Mathematical Logic, 1976, Stiinca, Kishinev, p.118 (in Russian) | en_US |
| dc.identifier.uri | https://dspace.lu.lv/dspace/handle/7/1463 | |
| dc.language.iso | rus | en_US |
| dc.publisher | Stiinca, Kishinev | en_US |
| dc.rights | info:eu-repo/semantics/openAccess | en_US |
| dc.subject | double incompleteness | en_US |
| dc.subject | incompleteness | en_US |
| dc.subject | incompleteness theorem | en_US |
| dc.title | The double-incompleteness theorem | en_US |
| dc.type | Article | en_US |