A finitely axiomatizable undecidable equational theory with recursively solvable word problems

DOI10.1090/S0002-9947-99-02339-9zbMath0948.03008OpenAlexW1744887257MaRDI QIDQ4955722

Dejan Delić

Publication date: 22 May 2000

Published in: Transactions of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1090/s0002-9947-99-02339-9

zbMATH Keywords

undecidable equational theorymany-sorted logicsrecursively solvable word problems

Mathematics Subject Classification ID

Automata and formal grammars in connection with logical questions (03D05) Decidability of theories and sets of sentences (03B25) Equational logic, Mal'tsev conditions (08B05) Word problems, etc. in computability and recursion theory (03D40) Equational classes, universal algebra in model theory (03C05) Word problems (aspects of algebraic structures) (08A50)

Related Items (3)

PSEUDORECURSIVE VARIETIES OF SEMIGROUPS — II ⋮ Many-sorted and single-sorted algebras ⋮ Applying, extending, and specializing pseudorecursiveness

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computability, complexity, logic. Transl. from the German
• The structure of decidable locally finite varieties
• A field guide to equational logic
• Characterizing Mal'cev conditions
• The complexity of the word problems for commutative semigroups and polynomial ideals
• A variety with locally solvable but globally unsolvable word problem
• Über deduktive Theorien mit mehreren Sorten von Grunddingen
• PSEUDORECURSIVE VARIETIES OF SEMIGROUPS—I
• On spectra, and the negative solution of the decision problem for identities having a finite nontrivial model
• A Variety with Solvable, but not Uniformly Solvable, Word Problem
• Polynomial Time Uniform Word Problems
• ALGORITHMIC PROBLEMS IN VARIETIES

This page was built for publication: A finitely axiomatizable undecidable equational theory with recursively solvable word problems