Finitely presented expansions of computably enumerable semigroups

DOI10.1007/S10469-012-9203-8MaRDI QIDQ1936272zbMATH OpenOpenAlexFDO

Authors Denis R. Hirschfeldt, Bakhadyr Khoussainov

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 semigroupfinitely presented expansion

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45) General structure theory for semigroups (20M10)

Recommendations

• Finitely presented expansions of groups, semigroups, and algebras
• Degrees of word problem for algebras without finitely presented expansions
• COMPUTABLY ENUMERABLE ALGEBRAS, THEIR EXPANSIONS, AND ISOMORPHISMS
• A journey to computably enumerable structures (tutorial lectures)
• Almost finite expansions of arbitrary semigroups

Cites work

• scientific article; zbMATH DE number 4079406 (Why is no real title available?)
• scientific article; zbMATH DE number 4091484 (Why is no real title available?)
• scientific article; zbMATH DE number 1302869 (Why is no real title available?)
• scientific article; zbMATH DE number 3220420 (Why is no real title available?)
• Algebraic specifications of computable and semicomputable data types
• Computable symbolic dynamics
• Finitely presented expansions of groups, semigroups, and algebras
• Generic-case complexity, decision problems in group theory, and random walks.
• Initial and Final Algebra Semantics for Data Type Specifications: Two Characterization Theorems
• Randnomness, computability, and algebraic specifications
• Two notes on subshifts

Cited in

(9)

• Finitely presented expansions of groups, semigroups, and algebras
• Finite Presentability of Bruck–Reilly Extensions of Semilattices
• Degrees of word problem for algebras without finitely presented expansions
• COMPUTABLY ENUMERABLE ALGEBRAS, THEIR EXPANSIONS, AND ISOMORPHISMS
• Reducibilities among equivalence relations induced by recursively enumerable structures
• A journey to computably enumerable structures (tutorial lectures)
• Construction of Semigroups with Some Exotic Properties
• Classifying word problems of finitely generated algebras via computable reducibility
• Computability theory. Abstracts from the workshop held January 7--13, 2018

This page was built for publication: Finitely presented expansions of computably enumerable semigroups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1936272)