On Interpretability Between Some Weak Essentially Undecidable Theories

@article{Kristiansen2020OnIB,
  title={On Interpretability Between Some Weak Essentially Undecidable Theories},
  author={Lars Kristiansen and Juvenal Murwanashyaka},
  journal={Beyond the Horizon of Computability},
  year={2020},
  volume={12098},
  pages={63 - 74}
}
We introduce two essentially undecidable first-order theories \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathsf {WT}$$\end{document} and \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage… 

Weak essentially undecidable theories of concatenation

In the language {0,1,∘,⪯}\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs}

MUTUAL INTERPRETABILITY OF WEAK ESSENTIALLY UNDECIDABLE THEORIES

It is proved that T is interpretable in Q by producing a formal interpretation of T in an elementary concatenation theory QT+, thereby also establishing mutual interpretability of T with several well-known weak essentially undecidable theories of numbers, strings, and sets.

Undecidability in First-Order Theories of Term Algebras Extended with a Substitution Operator

We introduce a first-order theory of finite full binary trees and then identify decidable and undecidable fragments of this theory. We show that the analogue of Hilbert‘s 10th Problem is undecidable

Weak theories of concatenation and minimal essentially undecidable theories

It is proved that the theory of concatenation WTC-ε, which is a weak subtheory of Grzegorczyk’s theory, is a minimal essentially undecidable theory, and that if one omits an axiom scheme from the theory, then the resulting theory is no longer essentially Undecidable.

FINDING THE LIMIT OF INCOMPLETENESS I

  • Yong Cheng
  • Mathematics
    The Bulletin of Symbolic Logic
  • 2020
There is no theory with a minimal degree of Turing reducibility for which $\textsf {G1}$ holds, but it is shown that there are many such theories based on Jeřábek’s work using some model theory such that for any Turing degree, there is a theory T with Turing degree such that G1 holds.

Variants of Robinson's essentially undecidable theoryR

An essentially undecidable theory based on three axiom schemes involving only multiplication and less than or equals is given.

Recursive functions and existentially closed structures

There exists a theory T in which all partially recursive functions are representable, yet T does not interpret Robinson's theory R, and a certain characterization of $\exists\forall$ theories interpretable in existential theories in the process is obtained.

MUTUAL INTERPRETABILITY OF ROBINSON ARITHMETIC AND ADJUNCTIVE SET THEORY WITH EXTENSIONALITY

Abstract An elementary theory of concatenation, QT +, is introduced and used to establish mutual interpretability of Robinson arithmetic, Minimal Predicative Set Theory, quantifier-free part of

An Interpretation of Robinson Arithmetic in its Grzegorczyk's Weaker Variant

Q^- is a weaker variant of Robinson arithmetic Q in which addition and multiplication are partial functions, i.e. ternary relations that are graphs of possibly non-total functions. We show that Q is

Undecidability and Concatenation

We consider the problem stated by Andrzej Grzegorczyk in “Undecidability without arithmetization” (Studia Logica 79(2005)) whether certain weak theory of concatenation is essentially undecidable. We

Growing Commas. A Study of Sequentiality and Concatenation

  • A. Visser
  • Computer Science
    Notre Dame J. Formal Log.
  • 2009
It is shown that TC does not define pairing, and a reasonable extension of TC is determined that is sequential, i.e., has a good sequence coding.

First-order concatenation theory with bounded quantifiers

First-order concatenation theory with bounded quantifiers is studied, axiomatizations with interesting properties are given, and a number of decidability and undecidability results are proved.

Why the theory R is special

  • 2009