We study computably enumerable equivalence relations (abbreviated as ceers) under
computable reducibility, and we investigate the resulting degree structure Ceers, which is a …

We study computably enumerable equivalence relations (ceers), under the reducibility if
there exists a computable function f such that. We show that the degrees of ceers under the …

In mathematics, we know there are some concepts-objects, constructions, structures, proofs-
that are more complex and difficult to describe than others. Computable structure theory …

3. Theories, types, models, and diagrams. 138 4. Small theories and their models. 144 5.
Effective categoricity. 148 6. Automorphisms of effective structures. 156 7. Degree spectra of …

We review the literature on universal computably enumerable equivalence relations, ie the
computably enumerable equivalence relations (ceers) which are Σ^ 0_1-complete with …

In this paper, we survey recent work in the study of classes of structures from the viewpoint of
computability theory. We consider different ways of classifying classes of structures in terms …

We show that the theory of the partial order of computably enumerable equivalence relations
(ceers) under computable reduction is 1-equivalent to true arithmetic. We show the same …

ON THE STRUCTURE OF COMPUTABLE REDUCIBILITY ON EQUIVALENCE RELATIONS OF
NATURAL NUMBERS • In descriptive set theory, Borel red Page 1 The Journal of Symbolic …

The well-known Pontryagin Duality (classically) reduces the study of compact abelian
groups to the algebraic theory of discrete abelian groups. At first glance, Pontryagin Duality …

§1. Introduction. In this article we review results on algorithmic presen- tations of infinitely
generated abelian groups. A pr Page 1 The Bulletin of Symbolic Logic Volume 20, Number 3 …