Switch to: References

Add citations

You must login to add citations.
  1. 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 (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  • Computable valued fields.Matthew Harrison-Trainor - 2018 - Archive for Mathematical Logic 57 (5-6):473-495.
    We investigate the computability-theoretic properties of valued fields, and in particular algebraically closed valued fields and p-adically closed valued fields. We give an effectiveness condition, related to Hensel’s lemma, on a valued field which is necessary and sufficient to extend the valuation to any algebraic extension. We show that there is a computable formally p-adic field which does not embed into any computable p-adic closure, but we give an effectiveness condition on the divisibility relation in the value group which is (...)
    No categories
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
    		•