UPDF AI

On Interpretability in the Theory of Concatenation

V. Svejdar

2009 · DOI: 10.1215/00294527-2008-029
43 Citations

TLDR

It is proved that a variant of Robinson arithmetic Q with non-total operations is interpretable in the theory of concatenation TC introduced by A. Grzegorczyk, giving a positive answer to the problem whether Q isinterpretable in TC.