|
On “simple” algorithmically undecidable fragments of elementary theory of an infinitely generated free semigroup
V. G. Durnev, O. V. Zetkina, A. I. Zetkina P. G. Demidov Yaroslavl' University (Yaroslavl')
Abstract:
We prove algorithmic undecidability of $\exists \forall^2 \exists^3$-theory for a free semigroup of countable rank. This strengthens the classical Quine's (1946) result [1] on algorithmic undecidability of elementary theory of an arbitrary non-cyclic free semigroup.
Keywords:
free semigroups, elementary theories.
Received: 24.04.2020 Accepted: 22.10.2020
Citation:
V. G. Durnev, O. V. Zetkina, A. I. Zetkina, “On “simple” algorithmically undecidable fragments of elementary theory of an infinitely generated free semigroup”, Chebyshevskii Sb., 21:4 (2020), 56–71
Linking options:
https://www.mathnet.ru/eng/cheb952 https://www.mathnet.ru/eng/cheb/v21/i4/p56
|
Statistics & downloads: |
Abstract page: | 138 | Full-text PDF : | 34 | References: | 19 |
|