Comparing classes of finite sums

DOI10.1007/s10469-016-9368-7zbMath1375.03034MaRDI QIDQ282120

F. Blanchet-Sadri, M. Dambrine

Publication date: 12 May 2016

Published in: Algebra and Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10469-016-9368-7

zbMATH Keywords

classes of finite sums; complexity of sentences; Morley degree; Turing computable embedding

Mathematics Subject Classification ID

20K10: Torsion groups, primary groups and generalized primary groups

03D30: Other degrees and reducibilities in computability and recursion theory

20K25: Direct sums, direct products, etc. for abelian groups

03C57: Computable structure theory, computable model theory

03D45: Theory of numerations, effectively presented structures