Toggle navigation
English
Norsk
English
English
Norsk
Administration
Toggle navigation
View Item
Home
Øvrige samlinger
Høstingsarkiver
CRIStin høstingsarkiv
View Item
Home
Øvrige samlinger
Høstingsarkiver
CRIStin høstingsarkiv
View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.
There are no minimal essentially undecidable theories
Murwanashyaka, Juvenal
;
Pakhomov, Fedor
;
Visser, Albert
Journal article
; PublishedVersion
; Peer reviewed
View/
Open
There+are+no+mi ... +undecidable+theories+.pdf (333.9Kb)
Year
2023
CRIStin
2135911
Metadata
Show metadata
Appears in the following Collection
Matematisk institutt
[3781]
CRIStin høstingsarkiv
[31446]
Original version
Journal of Logic and Computation. 2023,
DOI: https://doi.org/10.1093/logcom/exad005
Abstract
Abstract We show that there is no theory that is minimal with respect to interpretability among recursively enumerable essentially undecidable theories.
This item's license is: Attribution 4.0 International
Search all of DUO
Only this Collection
For students / employees
Submit master thesis
Access to restricted material
Browse
All of DUO
Communities & Collections
By Issue Date
Authors
Titles
This Collection
By Issue Date
Authors
Titles
For library staff
Login
RSS Feeds