Switch to: References

Add citations

You must login to add citations.
  1. Orders on computable rings.Huishan Wu - 2020 - Mathematical Logic Quarterly 66 (2):126-135.
    The Artin‐Schreier theorem says that every formally real field has orders. Friedman, Simpson and Smith showed in [6] that the Artin‐Schreier theorem is equivalent to over. We first prove that the generalization of the Artin‐Schreier theorem to noncommutative rings is equivalent to over. In the theory of orderings on rings, following an idea of Serre, we often show the existence of orders on formally real rings by extending pre‐orders to orders, where Zorn's lemma is used. We then prove that “pre‐orders (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • 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   7 citations