Abstract
AbstractRelations between some theories of semigroups (also known as theories of strings or theories of concatenation) and arithmetic are surveyed. In particular Robinson's arithmetic Q is shown to be mutually interpretable with TC, a weak theory of concatenation introduced by Grzegorczyk. Furthermore, TC is shown to be interpretable in the theory F studied by Tarski and Szmielewa, thus confirming their claim that F is essentially undecidable.
Publisher
Cambridge University Press (CUP)
Reference18 articles.
1. Bennett J. , On spectra, Ph.D. thesis, Department of Mathematics, Princeton University, 1962.
2. Variants of Robinson's essentially undecidable theoryR
3. An interpretation of Robinson Arithmetic in its Grzegorczyk's weaker variant;Švejdar;Fundamenta Informaticae,2007
Cited by
15 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献