Skip to main content
Conference ProceedingsOPEN ACCESS

On Interpretability Between Some Weak Essentially Undecidable Theories

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2020) 12098 LNCS 63-74
DOI: 10.1007/978-3-030-51466-2_6
4Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We introduce two essentially undecidable first-order theories. The intended model for the theories is a term model. We prove that is mutually interpretable with Robinson’s. Moreover, we prove that Robinson’s is interpretable in.

Cite

CITATION STYLE

APA

Kristiansen, L., & Murwanashyaka, J. (2020). On Interpretability Between Some Weak Essentially Undecidable Theories. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 12098 LNCS, pp. 63–74). Springer. https://doi.org/10.1007/978-3-030-51466-2_6

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free