Pseudorecursive varieties of semigroups. II
type: Item
instance of: scholarly article
zbMATH Open document ID: 1256.03048
DOI: 10.1142/S0218196712500427
published in: International Journal of Algebra and Computation
publication date: 2012-08-30T00:00:00Z
Mathematics Subject Classification ID: 03D35
Mathematics Subject Classification ID: 03C05
Mathematics Subject Classification ID: 03D40
Mathematics Subject Classification ID: 20M07
Mathematics Subject Classification ID: 68Q42
zbMATH DE Number: 6074267
zbMATH Keywords: equational logic
zbMATH Keywords: variety
zbMATH Keywords: semigroup
zbMATH Keywords: undecidable theory
zbMATH Keywords: interpretation
zbMATH Keywords: reducibility
zbMATH Keywords: word problem
zbMATH Keywords: rewriting system
author: Benjamin Wells
MaRDI profile type: Publication
cites work: A variety with locally solvable but globally unsolvable word problem
cites work: A LOCALLY FINITE VARIETY OF RINGS WITH AN UNDECIDABLE EQUATIONAL THEORY
cites work: A finitely axiomatizable undecidable equational theory with recursively solvable word problems
cites work: Q5643567
cites work: On locally finite varieties with undecidable equational theory.
cites work: ALGORITHMIC PROBLEMS IN VARIETIES
cites work: Q3856120
cites work: Formal Reductions of the General Combinatorial Decision Problem
cites work: PSEUDORECURSIVE VARIETIES OF SEMIGROUPS—I
cites work: Applying, extending, and specializing pseudorecursiveness
cites work: Hypercomputation by definition
title: Pseudorecursive varieties of semigroups. II
description: scientific article; zbMATH DE number 6074267