A variety with locally solvable but globally unsolvable word problem

DOI10.1007/BF01197182MaRDI QIDQ1918965zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 23 July 1996

Published in Algebra Universalis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01197182

zbMATH Keywords

local word problemundecidable equational theoryvariety of finite type

Mathematics Subject Classification ID

Undecidability and degrees of sets of sentences (03D35) Word problems, etc. in computability and recursion theory (03D40) Word problems (aspects of algebraic structures) (08A50) Equational logic, Mal'tsev conditions (08B05)

Review text

The authors describe a variety of finite type with an undecidable equational theory, whose local word problem is solvable since there are finite bounds for the cardinality of finitely generated algebras.

Cites work

• A Variety with Solvable, but not Uniformly Solvable, Word Problem
• scientific article; zbMATH DE number 3751028 (Why is no real title available?)
• scientific article; zbMATH DE number 3550662 (Why is no real title available?)
• PSEUDORECURSIVE VARIETIES OF SEMIGROUPS—I

Cited in

(7)

• Pseudorecursive varieties of semigroups. II
• A LOCALLY FINITE VARIETY OF RINGS WITH AN UNDECIDABLE EQUATIONAL THEORY
• A Variety with Solvable, but not Uniformly Solvable, Word Problem
• scientific article; zbMATH DE number 1482197 (Why is no real title available?)
• THE TYPE SET OF A VARIETY IS NOT COMPUTABLE
• A finitely axiomatizable undecidable equational theory with recursively solvable word problems
• Applying, extending, and specializing pseudorecursiveness

This page was built for publication: A variety with locally solvable but globally unsolvable word problem

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