Switch to: Citations

Add references

You must login to add references.
  1. Undecidability and recursive inseparability.Raymond M. Smullyan - 1958 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 4 (7-11):143-147.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Π10 classes and orderable groups.Reed Solomon - 2002 - Annals of Pure and Applied Logic 115 (1-3):279-302.
    It is known that the spaces of orders on orderable computable fields can represent all Π10 classes up to Turing degree. We show that the spaces of orders on orderable computable abelian and nilpotent groups cannot represent Π10 classes in even a weak manner. Next, we consider presentations of ordered abelian groups, and we show that there is a computable ordered abelian group for which no computable presentation admits a computable set of representatives for its Archimedean classes.
    Download  
     
    Export citation  
     
    Bookmark   5 citations