On ``simple algorithmically undecidable fragments of elementary theory of an infinitely generated free semigroup

MaRDI QIDQ5154924zbMATH OpenFDO

Authors V. G. Durnev, O. V. Zetkina, A. I. Zetkina

Publication date 5 October 2021

Full work available at URL http://mathnet.ru/eng/cheb952

zbMATH Keywords

elementary theoriesfree semigroups

Mathematics Subject Classification ID

Free semigroups, generators and relations, word problems (20M05) Undecidability and degrees of sets of sentences (03D35)

Recommendations

• Undecidability of the positive \(\forall\exists^ 3\)-theory of a free semigroup
• scientific article; zbMATH DE number 3924767
• Undecidability of a simple fragment of a positive theory with a single constant for a free semigroup of rank two
• scientific article; zbMATH DE number 1748026
• scientific article; zbMATH DE number 4087622

Cited in

(9)

• scientific article; zbMATH DE number 1748026 (Why is no real title available?)
• Undecidability of a simple fragment of a positive theory with a single constant for a free semigroup of rank two
• scientific article; zbMATH DE number 7120897 (Why is no real title available?)
• scientific article; zbMATH DE number 1567880 (Why is no real title available?)
• scientific article; zbMATH DE number 3946109 (Why is no real title available?)
• scientific article; zbMATH DE number 3934999 (Why is no real title available?)
• Undecidability of the positive \(\forall\exists^ 3\)-theory of a free semigroup
• scientific article; zbMATH DE number 3924767 (Why is no real title available?)
• scientific article; zbMATH DE number 4087622 (Why is no real title available?)

This page was built for publication: On ``simple algorithmically undecidable fragments of elementary theory of an infinitely generated free semigroup

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