scientific article; zbMATH DE number 1482215

zbMATH Open0945.08002MaRDI QIDQ4492883FDOQ4492883

Authors: Siniša Crvenković, Igor Dolinka 

Publication date: 27 July 2000

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

Title of this publication is not available (Why is that?)

Recommendations

• scientific article; zbMATH DE number 1868880
• scientific article; zbMATH DE number 3287732
• scientific article; zbMATH DE number 1123898
• Publication:4492868
• scientific article; zbMATH DE number 1186371

zbMATH Keywords

decidabilityword problemequational theoryrecursively based semigroup variety

Mathematics Subject Classification ID

Free semigroups, generators and relations, word problems (20M05) Varieties and pseudovarieties of semigroups (20M07) Word problems (aspects of algebraic structures) (08A50) Word problems, etc. in computability and recursion theory (03D40)

Cited In (13)

• A decidable word problem without equivalent canonical term rewriting system
• A codicity undecidable problem in the plane.
• The word problem in varieties of semigroups, rings, and Lie algebras
• Title not available (Why is that?)
• IDENTITIES IN THE ALGEBRA OF PARTIAL MAPS
• Undecidability of the word problem for Yamamura's HNN-extension under nice conditions.
• Solving the Caesar problem without categorical sortals
• Algebras defined by equations
• Title not available (Why is that?)
• Title not available (Why is that?)
• On locally finite varieties with undecidable equational theory.
• A finitely axiomatizable undecidable equational theory with recursively solvable word problems
• Title not available (Why is that?)

This page was built for publication:

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