On a connection between the word problem and decidability of the equational theory

DOI10.1007/BF02674748zbMath0957.03012MaRDI QIDQ1595492

V. Yu. Popov

Publication date: 12 February 2001

Published in: Siberian Mathematical Journal (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/120839

zbMATH Keywords

word problemdecidabilityequational theorymonogenic ring

Mathematics Subject Classification ID

Undecidability and degrees of sets of sentences (03D35) Decidability of theories and sets of sentences (03B25) Applications of logic to commutative algebra (13L05) Word problems, etc. in computability and recursion theory (03D40)

Cites Work

• Unnamed Item