Computably Enumerable Structures: Domain dependency

• Bakhadyr Khoussainov

Computably Enumerable Structures: Domain dependency

Computably enumerable structures arise naturally in algebra and computer science. In algebra examples include finitely presented universal algebras such as finitely presented groups. In computer science, these are abstract data types defined by equational or quasi-equational specifications. The domains of these algebraic structures are quotient sets of the form ω / 𝐸, where ω is the set of natural numbers and 𝐸 is a computably enumerable (c.e.) equivalence relations. We consider c.e. structures whose domains are of the form ω / 𝐸 and study various properties of these structures and their dependence on the domain ω / 𝐸