The word problem for cancellation semigroups with zero

DOI10.2307/2274101zbMath0586.03037OpenAlexW1995628728MaRDI QIDQ3712329

Harry R. Lewis, Yuri Gurevich

Publication date: 1984

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

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

zbMATH Keywords

effectively inseparable sets of formulas

Mathematics Subject Classification ID

Free semigroups, generators and relations, word problems (20M05) Word problems, etc. in computability and recursion theory (03D40)

Related Items (7)

Relational lattices: from databases to universal algebra ⋮ On Satisfiability in ATL with Strategy Contexts ⋮ Decidable and undecidable logics with a binary modality ⋮ On subsumption and semiunification in feature algebras ⋮ Database Theory, Yuri, and Me ⋮ UNDECIDABILITY, AUTOMATA, AND PSEUDOVARITIES OF FINITE SEMIGROUPS ⋮ The implication and finite implication problems for typed template dependencies

Cites Work

• Unnamed Item
• An analysis of Turing's The word problem in semi-groups with cancellation
• Unsolvability of the universal theory of finite groups
• The word problem in semi-groups with cancellation
• Recursive Unsolvability of a problem of Thue

This page was built for publication: The word problem for cancellation semigroups with zero