Decidability of elementary theories of certain finitely defined algebras

DOI10.1007/BF01985064zbMath0772.03003MaRDI QIDQ1803020

L. V. Shabunin

Publication date: 29 June 1993

Published in: Algebra and Logic (Search for Journal in Brave)

zbMATH Keywords

decidable first order theoryfinitely defined algebra

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Word problems (aspects of algebraic structures) (08A50)

Related Items

On finitely presented and free algebras of Cantor varieties

Cites Work

• Solution of the basic algorithmic problems in some classes of quasigroups with identities
• On theories with a combinatorial definition of 'equivalence'
• Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
• The Word Problem for Abstract Algebras
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Decidability of elementary theories of certain finitely defined algebras