Degrees of word problem for algebras without finitely presented expansions
From MaRDI portal
(Redirected from Publication:2988856)
Theory of numerations, effectively presented structures (03D45) Applications of computability and recursion theory (03D80) Operations and polynomials in algebraic structures, primal algebras (08A40) Finite generation, finite presentability, normal forms (diamond lemma, term-rewriting) (16S15) Free semigroups, generators and relations, word problems (20M05)
Recommendations
- Finitely presented expansions of groups, semigroups, and algebras
- Finitely presented expansions of computably enumerable semigroups
- scientific article; zbMATH DE number 3995984
- Turing degrees and the word and conjugacy problems for finitely presented groups.
- Word problems and recursively enumerable degrees of unsolvability. A sequel on finitely presented groups
Cites work
- Algebraic specifications of computable and semicomputable data types
- Algebras with finitely approximable positively representable enrichments
- Finitely presented expansions of computably enumerable semigroups
- Finitely presented expansions of groups, semigroups, and algebras
- scientific article; zbMATH DE number 4091484 (Why is no real title available?)
- Initial and Final Algebra Semantics for Data Type Specifications: Two Characterization Theorems
- Randnomness, computability, and algebraic specifications
Cited in
(3)
This page was built for publication: Degrees of word problem for algebras without finitely presented expansions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2988856)