There are no minimal essentially undecidable theories

Juvenal Murwanashyaka; Fedor Pakhomov; Albert Visser

doi:10.1093/logcom/exad005

There are no minimal essentially undecidable theories

Juvenal Murwanashyaka, Fedor Pakhomov, Albert Visser^*

^*Corresponding author for this work

Research output: Contribution to journal › Article › Academic › peer-review

Abstract

We show that there is no theory that is minimal with respect to interpretability among recursively enumerable essentially undecidable theories.

Original language	English
Pages (from-to)	1159-1171
Number of pages	13
Journal	Journal of Logic and Computation
Volume	34
Issue number	6
DOIs	https://doi.org/10.1093/logcom/exad005
Publication status	Published - 1 Sept 2024

Bibliographical note

Publisher Copyright:
© The Author(s) 2023.

Funding

Acknowledgements We thank Yong Cheng and Tim Button for comments on and their corrections to the preprint version of this paper. We thank the two anonymous referees for their helpful comments. Research of Fedor Pakhomov was supported by FWO (G0F8421N).

Funders	Funder number
FWO	G0F8421N

Keywords

interpretability
essential undecidability

Access to Document

10.1093/logcom/exad005Licence: CC BY

exad005Final published version, 257 KBLicence: CC BY

Cite this

@article{e8e42b93994244f5b088776e1b35e6fd,

title = "There are no minimal essentially undecidable theories",

abstract = "We show that there is no theory that is minimal with respect to interpretability among recursively enumerable essentially undecidable theories.",

keywords = "interpretability, essential undecidability",

author = "Juvenal Murwanashyaka and Fedor Pakhomov and Albert Visser",

note = "Publisher Copyright: {\textcopyright} The Author(s) 2023.",

year = "2024",

month = sep,

day = "1",

doi = "10.1093/logcom/exad005",

language = "English",

volume = "34",

pages = "1159--1171",

journal = "Journal of Logic and Computation",

issn = "0955-792X",

publisher = "Oxford University Press",

number = "6",

}

TY - JOUR

T1 - There are no minimal essentially undecidable theories

AU - Murwanashyaka, Juvenal

AU - Pakhomov, Fedor

AU - Visser, Albert

PY - 2024/9/1

Y1 - 2024/9/1

N2 - We show that there is no theory that is minimal with respect to interpretability among recursively enumerable essentially undecidable theories.

AB - We show that there is no theory that is minimal with respect to interpretability among recursively enumerable essentially undecidable theories.

KW - interpretability

KW - essential undecidability

UR - http://www.scopus.com/inward/record.url?scp=85203866335&partnerID=8YFLogxK

U2 - 10.1093/logcom/exad005

DO - 10.1093/logcom/exad005

M3 - Article

AN - SCOPUS:85203866335

SN - 0955-792X

VL - 34

SP - 1159

EP - 1171

JO - Journal of Logic and Computation

JF - Journal of Logic and Computation

IS - 6

ER -

There are no minimal essentially undecidable theories

Abstract

Bibliographical note

Funding

Keywords

Access to Document

Other files and links

Fingerprint

Cite this