© 2014, Pleiades Publishing, Ltd. This is a short article based on the plenary lecture presented by the author at Algebra Computability and Logic conference in Kazan, June 1–6, 2014. The paper is a new approach that introduces effectiveness into the study of algebraic structures. In this approach the initial objects are the domains of the form ω/E, where E is an equivalence relation on ω. In this set-up one investigates effective algebraic structures that are admitted by domains of the formω/E. This lecture was motivated by the papers [2, 20, 21], open questions in [17], and is based on the papers [15, 16, 19, 23]
AbstractA concrete model of computation for a topological algebra is based on a representation of th...
We prove various results about the complexity of countable structures, both computable and arbitrary...
Abstract. We survey some of the recent results on the structure of the computably enumerable (c.e.) ...
© 2014, Pleiades Publishing, Ltd. This is a short article based on the plenary lecture presented by ...
© 2014, Pleiades Publishing, Ltd. This is a short article based on the plenary lecture presented by ...
© 2014, Pleiades Publishing, Ltd. This is a short article based on the plenary lecture presented by ...
AbstractWe investigate effective categoricity of computable equivalence structures A. We show that A...
Abstract. Computably enumerable algebras are the ones whose positive atomic diagrams are computably ...
Abstract. Computably enumerable algebras are the ones whose positive atomic di-agrams are computably...
AbstractThe spectrum of a relation R on a computable structure is the set of Turing degrees of the i...
Abstract. We study computably enumerable equivalence relations (ceers) on N and unravel a rich struc...
AbstractWe exploit properties of certain directed graphs, obtained from the families of sets with sp...
AbstractIn this paper ω-algebraic complete partial orders are considered the compact elements of whi...
AbstractWe investigate effective categoricity of computable equivalence structures A. We show that A...
We describe all possible relations between certain reducibities of algebraic structures which are ba...
AbstractA concrete model of computation for a topological algebra is based on a representation of th...
We prove various results about the complexity of countable structures, both computable and arbitrary...
Abstract. We survey some of the recent results on the structure of the computably enumerable (c.e.) ...
© 2014, Pleiades Publishing, Ltd. This is a short article based on the plenary lecture presented by ...
© 2014, Pleiades Publishing, Ltd. This is a short article based on the plenary lecture presented by ...
© 2014, Pleiades Publishing, Ltd. This is a short article based on the plenary lecture presented by ...
AbstractWe investigate effective categoricity of computable equivalence structures A. We show that A...
Abstract. Computably enumerable algebras are the ones whose positive atomic diagrams are computably ...
Abstract. Computably enumerable algebras are the ones whose positive atomic di-agrams are computably...
AbstractThe spectrum of a relation R on a computable structure is the set of Turing degrees of the i...
Abstract. We study computably enumerable equivalence relations (ceers) on N and unravel a rich struc...
AbstractWe exploit properties of certain directed graphs, obtained from the families of sets with sp...
AbstractIn this paper ω-algebraic complete partial orders are considered the compact elements of whi...
AbstractWe investigate effective categoricity of computable equivalence structures A. We show that A...
We describe all possible relations between certain reducibities of algebraic structures which are ba...
AbstractA concrete model of computation for a topological algebra is based on a representation of th...
We prove various results about the complexity of countable structures, both computable and arbitrary...
Abstract. We survey some of the recent results on the structure of the computably enumerable (c.e.) ...