Switch to: References

Add citations

You must login to add citations.
  1. Computable Abelian groups.Alexander G. Melnikov - 2014 - Bulletin of Symbolic Logic 20 (3):315-356,.
    We provide an introduction to methods and recent results on infinitely generated abelian groups with decidable word problem.
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • Torsion-free abelian groups with optimal Scott families.Alexander G. Melnikov - 2018 - Journal of Mathematical Logic 18 (1):1850002.
    We prove that for any computable successor ordinal of the form α = δ + 2k there exists computable torsion-free abelian group that is relatively Δα0 -categorical and not Δα−10 -categorical. Equivalently, for any such α there exists a computable TFAG whose initial segments are uniformly described by Σαc infinitary computable formulae up to automorphism, and there is no syntactically simpler family of formulae that would capture these orbits. As far as we know, the problem of finding such optimal examples (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • New Degree Spectra of Abelian Groups.Alexander G. Melnikov - 2017 - Notre Dame Journal of Formal Logic 58 (4):507-525.
    We show that for every computable ordinal of the form β=δ+2n+1>1, where δ is zero or a limit ordinal and n∈ω, there exists a torsion-free abelian group having an X-computable copy if and only if X is nonlowβ.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Strange Structures from Computable Model Theory.Howard Becker - 2017 - Notre Dame Journal of Formal Logic 58 (1):97-105.
    Let L be a countable language, let I be an isomorphism-type of countable L-structures, and let a∈2ω. We say that I is a-strange if it contains a computable-from-a structure and its Scott rank is exactly ω1a. For all a, a-strange structures exist. Theorem : If C is a collection of ℵ1 isomorphism-types of countable structures, then for a Turing cone of a’s, no member of C is a-strange.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • On Δ 2 0 -categoricity of equivalence relations.Rod Downey, Alexander G. Melnikov & Keng Meng Ng - 2015 - Annals of Pure and Applied Logic 166 (9):851-880.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Turing computable embeddings and coding families of sets.Víctor A. Ocasio-González - 2012 - In S. Barry Cooper (ed.), How the World Computes. pp. 539--548.
    Download  
     
    Export citation  
     
    Bookmark