Monoids with decidable and undecidable classes of polygons

DOI10.1007/BF02673912zbMATH Open0902.03020MaRDI QIDQ1272004FDOQ1272004

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

groupmonoidpolygondecidable classhereditarily undecidable class

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• The structure of decidable locally finite varieties
• Title not available (Why is that?)

Cited In (3)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

   Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• 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 👍 👎

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)