Decidable properties of finite sets of equations in trivial languages

DOI10.2307/2274282zbMath0575.03006OpenAlexW2055707246MaRDI QIDQ3693502

Cornelia Kalfa

Publication date: 1984

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2274282

zbMATH Keywords

algorithmmodel-completejoint embedding propertyequationally completetrivial algebraic language

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25)

Related Items (2)

Decision problems concerning properties of finite sets of equations ⋮ Covering relation in the language of mono-unary algebras with at most one constant symbol

This page was built for publication: Decidable properties of finite sets of equations in trivial languages