This article is cited in 4 papers

Comparing classes of finite sums

U. Andrews^a, D. I. Dushenin^b, C. Hill^c, J. F. Knight^d, A. G. Melnikov<sup>e

a</sup> Department of Mathematics, University of Wisconsin, Madison, WI, 53706-1388, USA
^b SNIIGGiMS, Krasnyi pr. 67, Novosibirsk, Russia
^c Department of Mathematics and Computer Science, Wesleyan University, Middletown, CT, 06459, USA
^d Department of Mathematics, Univ. Notre Dame, 255 Hurley, Notre Dame, IN, 46556, USA
^e Institute of Natural and Mathematical Sciences, Massey University, Palmerston North, 4442, New Zealand

Abstract: The notion of Turing computable embedding is a computable analog of Borel embedding. It provides a way to compare classes of countable structures, effectively reducing the classification problem for one class to that for the other. Most of the known results on nonexistence of Turing computable embeddings reflect differences in the complexity of the sentences needed to distinguish among nonisomorphic members of the two classes. Here we consider structures obtained as sums. It is shown that the $n$-fold sums of members of certain classes lie strictly below the $(n+1)$-fold sums. The differences reflect model-theoretic considerations related to Morley degree, not differences in the complexity of the sentences that describe the structures. We consider three different kinds of sum structures: cardinal sums, in which the components are named by predicates; equivalence sums, in which the components are equivalence classes under an equivalence relation; and direct sums of certain groups.

Keywords: Turing computable embedding, classes of finite sums, Morley degree, complexity of sentences.

UDC: 510.5

Received: 08.07.2013
Revised: 18.02.2015

DOI: 10.17377/alglog.2015.54.605

 English version: Algebra and Logic, 2016, 54:6, 489–501

Bibliographic databases:

• 
• 
•