Finitely presented expansions of computably enumerable semigroups

DOI10.1007/s10469-012-9203-8zbMath1334.03038MaRDI QIDQ1936272

Bakhadyr Khoussainov, Denis R. Hirschfeldt

Publication date: 21 February 2013

Published in: Algebra and Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10469-012-9203-8

zbMATH Keywords

computably enumerable semigroup; finitely presented expansion

Mathematics Subject Classification ID

20M10: General structure theory for semigroups

03C57: Computable structure theory, computable model theory

03D45: Theory of numerations, effectively presented structures

Related Items

Finitely presented expansions of groups, semigroups, and algebras, Reducibilities among equivalence relations induced by recursively enumerable structures, Computability theory. Abstracts from the workshop held January 7--13, 2018, Degrees of Word Problem for Algebras Without Finitely Presented Expansions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Algebraic specifications of computable and semicomputable data types
• Randnomness, computability, and algebraic specifications
• Generic-case complexity, decision problems in group theory, and random walks.
• Computable symbolic dynamics
• Initial and Final Algebra Semantics for Data Type Specifications: Two Characterization Theorems
• Two notes on subshifts
• Finitely presented expansions of groups, semigroups, and algebras