Hide metadata

dc.date.accessioned2020-08-11T19:13:11Z
dc.date.available2021-06-24T22:45:44Z
dc.date.created2020-03-21T05:19:35Z
dc.date.issued2020
dc.identifier.citationKristiansen, Lars Murwanashyaka, Juvenal . On Interpretability between some weak essential undecidable theories.. Lecture Notes in Computer Science (LNCS). 2020
dc.identifier.urihttp://hdl.handle.net/10852/78279
dc.description.abstractWe introduce two essentially undecidable first-order theories WT and T. The intended model for the theories is a term model. We prove that WT is mutually interpretable with Robinson’s R. Moreover, we prove that Robinson’s Q is interpretable in T.en_US
dc.languageEN
dc.titleOn Interpretability between some weak essential undecidable theories.en_US
dc.typeJournal articleen_US
dc.creator.authorKristiansen, Lars
dc.creator.authorMurwanashyaka, Juvenal
cristin.unitcode185,15,13,0
cristin.unitnameMatematisk institutt
cristin.ispublishedfalse
cristin.fulltextpostprint
cristin.qualitycode1
dc.identifier.cristin1802755
dc.identifier.bibliographiccitationinfo:ofi/fmt:kev:mtx:ctx&ctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.jtitle=Lecture Notes in Computer Science (LNCS)&rft.volume=&rft.spage=&rft.date=2020
dc.identifier.jtitleLecture Notes in Computer Science (LNCS)
dc.identifier.startpage63
dc.identifier.endpage74
dc.identifier.doihttps://doi.org/10.1007/978-3-030-51466-2_6
dc.identifier.urnURN:NBN:no-81378
dc.type.documentTidsskriftartikkelen_US
dc.type.peerreviewedPeer reviewed
dc.source.issn0302-9743
dc.identifier.fulltextFulltext https://www.duo.uio.no/bitstream/handle/10852/78279/2/dcie20.pdf
dc.type.versionAcceptedVersion


Files in this item

Appears in the following Collection

Hide metadata