DECIDABILITY OF THE POSITIVE THEORY OF A FREE COUNTABLY GENERATED SEMIGROUP

DOI10.1070/SM1983V044N01ABEH000954zbMATH Open0497.20046OpenAlexW2000209921MaRDI QIDQ3961663FDOQ3961663

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

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

Cited In (4)

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

This page was built for publication: DECIDABILITY OF THE POSITIVE THEORY OF A FREE COUNTABLY GENERATED SEMIGROUP

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