Degrees of Word Problem for Algebras Without Finitely Presented Expansions

DOI10.1007/978-3-319-55911-7_46zbMath1461.03040OpenAlexW2599480757MaRDI QIDQ2988856

Huishan Wu, Guohua Wu

Publication date: 19 May 2017

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-55911-7_46

zbMATH Keywords

word problemfinitely presented expansioncomputably enumerable universal algebra

Mathematics Subject Classification ID

Finite generation, finite presentability, normal forms (diamond lemma, term-rewriting) (16S15) Free semigroups, generators and relations, word problems (20M05) Operations and polynomials in algebraic structures, primal algebras (08A40) Applications of computability and recursion theory (03D80) Theory of numerations, effectively presented structures (03D45)

Cites Work

• Algebraic specifications of computable and semicomputable data types
• Algebras with finitely approximable positively representable enrichments
• Randnomness, computability, and algebraic specifications
• Finitely presented expansions of computably enumerable semigroups
• Initial and Final Algebra Semantics for Data Type Specifications: Two Characterization Theorems
• Finitely presented expansions of groups, semigroups, and algebras
• Unnamed Item

This page was built for publication: Degrees of Word Problem for Algebras Without Finitely Presented Expansions