Finitely presented expansions of groups, semigroups, and algebras

DOI10.1090/S0002-9947-2013-05898-9zbMath1349.03045OpenAlexW1999660576MaRDI QIDQ5401728

Bakhadyr Khoussainov, Alexei G. Myasnikov

Publication date: 12 March 2014

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-2013-05898-9

Mathematics Subject Classification ID

Generators, relations, and presentations of groups (20F05) Free semigroups, generators and relations, word problems (20M05) Applications of computability and recursion theory (03D80) Free algebras (08B20) Equational classes, universal algebra in model theory (03C05) Theory of numerations, effectively presented structures (03D45)

Related Items

Residually finite algorithmically finite groups, their subgroups and direct products., Computable paradoxical decompositions, Sofic profiles of \(S(\omega)\) and computability, Partial word and equality problems and Banach densities, Uniformly computably separable algebras with effectively splittable families of negative congruences, Finitely presented expansions of computably enumerable semigroups, ON ISOMORPHISM CLASSES OF COMPUTABLY ENUMERABLE EQUIVALENCE RELATIONS, Classifying word problems of finitely generated algebras via computable reducibility, Degrees of Word Problem for Algebras Without Finitely Presented Expansions, On computably enumerable structures

Cites Work

• Unnamed Item
• Unnamed Item
• Algorithmically finite groups.
• Algebraic specifications of computable and semicomputable data types
• Handbook of recursive mathematics. Vol. 1: Recursive model theory
• Handbook of computability theory
• Randnomness, computability, and algebraic specifications
• Generic-case complexity, decision problems in group theory, and random walks.
• Finitely presented expansions of computably enumerable semigroups
• Computable symbolic dynamics
• Initial and Final Algebra Semantics for Data Type Specifications: Two Characterization Theorems
• Two notes on subshifts
• Computable Algebra, General Theory and Theory of Computable Fields
• On the Existence of Free Structures over Universal Classes