PSEUDORECURSIVE VARIETIES OF SEMIGROUPS — II

DOI10.1142/S0218196712500427zbMath1256.03048MaRDI QIDQ2909488

Benjamin B. jun. Wells

Publication date: 30 August 2012

Published in: International Journal of Algebra and Computation (Search for Journal in Brave)

zbMATH Keywords

reducibilitysemigroupequational logicword problemvarietyrewriting systeminterpretationundecidable theory

Mathematics Subject Classification ID

Varieties and pseudovarieties of semigroups (20M07) Undecidability and degrees of sets of sentences (03D35) Grammars and rewriting systems (68Q42) Word problems, etc. in computability and recursion theory (03D40) Equational classes, universal algebra in model theory (03C05)

Related Items (2)

Applying, extending, and specializing pseudorecursiveness ⋮ Hypercomputation by definition

Cites Work

• Unnamed Item
• Unnamed Item
• Applying, extending, and specializing pseudorecursiveness
• Hypercomputation by definition
• On locally finite varieties with undecidable equational theory.
• A variety with locally solvable but globally unsolvable word problem
• A LOCALLY FINITE VARIETY OF RINGS WITH AN UNDECIDABLE EQUATIONAL THEORY
• PSEUDORECURSIVE VARIETIES OF SEMIGROUPS—I
• ALGORITHMIC PROBLEMS IN VARIETIES
• A finitely axiomatizable undecidable equational theory with recursively solvable word problems
• Formal Reductions of the General Combinatorial Decision Problem

This page was built for publication: PSEUDORECURSIVE VARIETIES OF SEMIGROUPS — II