This article is cited in 1 scientific paper (total in 1 paper)
Comparing classes of finite sums
U. Andrewsa, D. I. Dusheninb, C. Hillc, J. F. Knightd, A. G. Melnikove
a 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
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.
Turing computable embedding, classes of finite sums, Morley degree, complexity of sentences.
|National Science Foundation
|Supported by NSF, grant DMS-1101123.
Supported by NSF, grant DMS-1201338.
PDF file (226 kB)
Algebra and Logic, 2016, 54:6, 489–501
U. Andrews, D. I. Dushenin, C. Hill, J. F. Knight, A. G. Melnikov, “Comparing classes of finite sums”, Algebra Logika, 54:6 (2015), 748–768; Algebra and Logic, 54:6 (2016), 489–501
Citation in format AMSBIB
\by U.~Andrews, D.~I.~Dushenin, C.~Hill, J.~F.~Knight, A.~G.~Melnikov
\paper Comparing classes of finite sums
\jour Algebra Logika
\jour Algebra and Logic
Citing articles on Google Scholar:
Related articles on Google Scholar:
This publication is cited in the following articles:
A. G. Melnikov, K. M. Ng, “Computable torsion abelian groups”, Adv. Math., 325 (2018), 864–907
|Number of views:|