• English
    • Latviešu
    • Deutsch
    • русский
  • Help
  • Latviešu 
    • English
    • Latviešu
    • Deutsch
    • русский
  • Login
View Item 
  •   DSpace Home
  • B6 – LU institūti un aģentūras / Institutes and agencies of the UL
  • Matemātikas un informātikas institūts / Institute of Mathematics and Computer Science
  • Publicēti raksti (MII) / Published Articles
  • View Item
  •   DSpace Home
  • B6 – LU institūti un aģentūras / Institutes and agencies of the UL
  • Matemātikas un informātikas institūts / Institute of Mathematics and Computer Science
  • Publicēti raksti (MII) / Published Articles
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

The double-incompleteness theorem

Thumbnail
View/Open
Podnieks_Double_1975.pdf (1.469Mb)
Author
Podnieks, Karlis
Date
1975
Metadata
Show full item record
Abstract
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 mathematics: Godel's theorem and around.
URI
https://dspace.lu.lv/dspace/handle/7/1462
Collections
  • Publicēti raksti (MII) / Published Articles [26]

University of Latvia
Contact Us | Send Feedback
Theme by 
@mire NV
 

 

Browse

All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

My Account

Login

Statistics

View Usage Statistics

University of Latvia
Contact Us | Send Feedback
Theme by 
@mire NV