There are no minimal essentially undecidable theories

dc.date.accessioned	2023-04-19T15:29:32Z
dc.date.available	2023-04-19T15:29:32Z
dc.date.created	2023-03-21T18:06:14Z
dc.date.issued	2023
dc.identifier.citation	Murwanashyaka, Juvenal Pakhomov, Fedor Visser, Albert . There are no minimal essentially undecidable theories. Journal of Logic and Computation. 2023
dc.identifier.uri	http://hdl.handle.net/10852/101967
dc.description.abstract	Abstract We show that there is no theory that is minimal with respect to interpretability among recursively enumerable essentially undecidable theories.
dc.language	EN
dc.rights	Attribution 4.0 International
dc.rights.uri	https://creativecommons.org/licenses/by/4.0/
dc.title	There are no minimal essentially undecidable theories
dc.title.alternative	ENEngelskEnglishThere are no minimal essentially undecidable theories
dc.type	Journal article
dc.creator.author	Murwanashyaka, Juvenal
dc.creator.author	Pakhomov, Fedor
dc.creator.author	Visser, Albert
cristin.unitcode	185,15,13,65
cristin.unitname	Flere komplekse variable, logikk og operatoralgebraer
cristin.ispublished	true
cristin.fulltext	original
cristin.qualitycode	1
dc.identifier.cristin	2135911
dc.identifier.bibliographiccitation	info:ofi/fmt:kev:mtx:ctx&ctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.jtitle=Journal of Logic and Computation&rft.volume=&rft.spage=&rft.date=2023
dc.identifier.jtitle	Journal of Logic and Computation
dc.identifier.doi	https://doi.org/10.1093/logcom/exad005
dc.type.document	Tidsskriftartikkel
dc.type.peerreviewed	Peer reviewed
dc.source.issn	0955-792X
dc.type.version	PublishedVersion