Comparing classes of finite sums

DOI10.1007/s10469-016-9368-7zbMath1375.03034OpenAlexW2185412223MaRDI 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 sumscomplexity of sentencesMorley degreeTuring computable embedding

Mathematics Subject Classification ID

Torsion groups, primary groups and generalized primary groups (20K10) Other degrees and reducibilities in computability and recursion theory (03D30) Direct sums, direct products, etc. for abelian groups (20K25) Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45)

Related Items (2)

Computable torsion abelian groups ⋮ Turing computable embeddings, computable infinitary equivalence, and linear orders

Cites Work

• A Borel reductibility theory for classes of countable structures
• On Σ¹ ₁ equivalence relations over the natural numbers
• Classes of Ulm type and coding rank-homogeneous trees in other structures
• The isomorphism problem for computable Abelian _p-groups of bounded length
• Index sets of computable structures
• Isomorphism relations on computable structures
• Isomorphism of Computable Structures and Vaught's Conjecture
• Turing computable embeddings
• Comparing Classes of Finite Structures
• Unnamed Item

This page was built for publication: Comparing classes of finite sums