A finitely axiomatizable undecidable equational theory with recursively solvable word problems
Work
Year: 1999
Type: article
Abstract: In this paper we construct a finitely based variety, whose equational theory is undecidable, yet whose word problems are recursively solvable, which solves a problem stated by G. McNulty (1992). The c... more
Author Dejan Delić
Institution University of Waterloo
Cites: 21
Cited by: 5
Related to: 10
FWCI: 0.424
Citation percentile (by year/subfield): 57.75
Topic: Advanced Algebra and Logic
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Sustainable Development Goal Reduced inequalities
Open Access status: bronze