DECIDABILITY OF THE POSITIVE THEORY OF A FREE COUNTABLY GENERATED SEMIGROUP

DOI10.1070/SM1983v044n01ABEH000954zbMath0497.20046OpenAlexW2000209921MaRDI QIDQ3961663

Yu. M. Vazhenin, Bella V. Rozenblat

Publication date: 1983

Published in: Mathematics of the USSR-Sbornik (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1070/sm1983v044n01abeh000954

zbMATH Keywords

free countably generated semigrouppositive theory of semigroups

Mathematics Subject Classification ID

Free semigroups, generators and relations, word problems (20M05) Decidability of theories and sets of sentences (03B25)

Related Items

Non-structural subtype entailment in automata theory, Combination of constraint solvers for free and quasi-free structures, Algebraic and logical aspects of unification, WORD EQUATIONS OVER GRAPH PRODUCTS