It has been previously observed that for many TxtEx-learnable computable families of computably enumerable (c.e. for short) sets all their computable numberings are evidently 0-equivalent, i.e. areâ€¦ (More)

We prove that if M is any model of a trivial, strongly minimal theory, then the elementary diagram Th(MM ) is a model complete LM -theory. We conclude that all countable models of a trivial, stronglyâ€¦ (More)

When bounds on complexity of some aspect of a structure are preserved under isomorphism, we refer to them as intrinsic. Here, building on work of Soskov [33], [34], we give syntactical conditionsâ€¦ (More)

Motivation: It is known that certain contextual characteristics of extended functional regions of genes influence their expression (Kochetov et al., 1998); however, the mechanisms underlying thisâ€¦ (More)

Describing the elementary theories of Rogers semilattices is one of the main problems of the theory of numberings. For the classical case of computable families of computably enumerable sets, V.V.â€¦ (More)

A surjective mapping Î± of the set IN of natural numbers onto a nonempty set A is called a numbering of A. The collections of all numberings of A will be denoted by Num(A). Suppose that A is a familyâ€¦ (More)

We show that every computable relation on a computable Boolean algebra B is either definable by a quantifier-free formula with constants from B (in which case it is obviously intrinsicallyâ€¦ (More)

We will discuss the problems about characterization of spec-trums of computable models for Uncountably Categorical theories. The basic notions can be find in [2]. From J. Baldwin [1] and A.Lachlan weâ€¦ (More)

In this paper we concentrate on open problems in two directions in the development of the theory of constructive algebraic systems. The first direction deals with universal algebras whose positiveâ€¦ (More)