Monoids with decidable and undecidable classes of polygons

DOI10.1007/BF02673912MaRDI QIDQ1272004zbMATH OpenFDO

Authors Alena Andreevna Stepanova

Publication date 22 November 1998

Published in Siberian Mathematical Journal (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/64183

zbMATH Keywords

decidable classgrouphereditarily undecidable classmonoidpolygon

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57) Model-theoretic algebra (03C60) Semigroups (20M99)

Review text

The author gives conditions on a monoid \(S\) for the class \(P^{S}\) of all \(S\)-polygons to be hereditarily undecidable. In case \(S\) is a group, a criterion for \(P^{S}\) to be decidable is obtained. The title of the article under review should be translated as follows ``Monoids with decidable or with undecidable classes of polygons.

Recommendations

• scientific article; zbMATH DE number 1254106
• scientific article; zbMATH DE number 2203308
• Undecidable properties of monoids with word problem solvable in linear time.
• New undecidability results for finitely presented monoids
• Axiomatizability and completeness of some classes of \(S\)-polygons

Cites work

• scientific article; zbMATH DE number 192904 (Why is no real title available?)
• scientific article; zbMATH DE number 3377532 (Why is no real title available?)
• The structure of decidable locally finite varieties

Cited in

(3)

• scientific article; zbMATH DE number 2007872 (Why is no real title available?)
• scientific article; zbMATH DE number 1923060 (Why is no real title available?)
• scientific article; zbMATH DE number 1899887 (Why is no real title available?)

This page was built for publication: Monoids with decidable and undecidable classes of polygons

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