Bi-interpretability of some monoids with the arithmetic and applications

From MaRDI portal
Publication:2003186

DOI10.1007/S00233-019-10021-4zbMATH Open1467.03030arXiv1803.06003OpenAlexW2964192494WikidataQ128118417 ScholiaQ128118417MaRDI QIDQ2003186FDOQ2003186

Olga Kharlampovich, L. López

Publication date: 16 July 2019

Published in: Semigroup Forum (Search for Journal in Brave)

Abstract: We will prove bi-interpretability of the arithmetic N=langleN,+,cdot,0,1angle and the weak second order theory of N with the free monoid mathbbMX of finite rank greater than 1 and with a non-trivial partially commutative monoid with trivial center. This bi-interpretability implies that finitely generated submonoids of these monoids are definable. Moreover, any recursively enumerable language in the alphabet X is definable in mathbbMX. Primitive elements, and, therefore, free bases are definable in the free monoid. It has the so-called QFA property, namely there is a sentence phi such that every finitely generated monoid satisfying phi is isomorphic to mathbbMX. The same is true for a partially commutative monoid without center. We also prove that there is no quantifier elimination in the theory of any structure that is bi-interpretable with mathbbN to any boolean combination of formulas from Pin or Sigman.


Full work available at URL: https://arxiv.org/abs/1803.06003





Cites Work


Cited In (2)






This page was built for publication: Bi-interpretability of some monoids with the arithmetic and applications

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2003186)