Browsing B6 – LU institūti un aģentūras / Institutes and agencies of the UL by Subject "double incompleteness"

Now showing items 1-2 of 2

    • The double-incompleteness theorem 

      Podnieks, Karlis (Stiinca, Kishinev, 1976)
      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 ...

    • The double-incompleteness theorem 

      Podnieks, Karlis (Latvia State University, 1975)
      Let T be a theory, Q - a metatheory of T. Under certain conditions there exist T-undecidable sentences for which this undecidability cannot be proved in Q. For English translation and proof, see K. Podnieks What is ...