Comparing classes of finite sums
DOI10.1007/S10469-016-9368-7zbMATH Open1375.03034OpenAlexW2185412223MaRDI QIDQ282120FDOQ282120
Authors: Uri Andrews, D. I. Dushenin, Clyde Denson Hill, J. F. Knight, Alexander Melnikov 
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
Recommendations
Torsion groups, primary groups and generalized primary groups (20K10) Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45) Direct sums, direct products, etc. for abelian groups (20K25) Other degrees and reducibilities in computability and recursion theory (03D30)
Cites Work
- Title not available (Why is that?)
- A Borel reductibility theory for classes of countable structures
- On Σ1 1 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
Cited In (7)
- Turing computable embeddings of equivalences other than isomorphism
- Turing computable embeddings and coding families of sets
- Turing computable embeddings
- Computable torsion abelian groups
- Turing computable embeddings, computable infinitary equivalence, and linear orders
- Comparing Comparisons: Infinite Sums vs. Partial Sums
- Measuring complexities of classes of structures
This page was built for publication: Comparing classes of finite sums
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q282120)
