6533b854fe1ef96bd12af0ab
RESEARCH PRODUCT
The double-incompleteness theorem
Karlis Podniekssubject
Mathematics::Logicincompleteness theoremComputer Science::Logic in Computer Sciencedouble incompletenessComputer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing)incompletenessComputer Science::Formal Languages and Automata Theorydescription
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.
| year | journal | country | edition | language |
|---|---|---|---|---|
| 1976-01-01 |