Deciding embeddability of partial groupoids into semigroups

DOI10.1007/BF03325437MaRDI QIDQ1293382zbMATH OpenFDO

Authors Deko V. Dekov

Publication date 13 March 2000

Published in Semigroup Forum (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF03325437

zbMATH Keywords

embeddability partial groupoid partial semigroup

Mathematics Subject Classification ID

Partial algebras (08A55) Axiomatic model classes (08C10) Sets with a single binary operation (groupoids) (20N02)

Review text

It is known that the embeddability problem for the class of finite partial groupoids is unsolvable, i.e. there is no algorithm for deciding whether or not a finite partial groupoid can be embedded into a semigroup. A partial groupoid is called a partial semigroup if it is embeddable into a semigroup. The class of all partial semigroups is a quasivariety (in the sense of models). It is proved (Theorem 1) that the class of all partial semigroups is not first-order finitely axiomatizable. Similar results are proved for other classes of partial groupoids (associative partial groupoids, \(R\)-presemigroups, \(S\)-presemigroups). Finally, the Knuth-Bendix completion procedure is used for deciding embeddability of finite partial groupoids into semigroups.

Recommendations

Cites work

Cited in

(10)

This page was built for publication: Deciding embeddability of partial groupoids into semigroups

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