Switch to: References

Add citations

You must login to add citations.
  1. 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  
  • Expanding the Reals by Continuous Functions Adds No Computational Power.Uri Andrews, Julia F. Knight, Rutger Kuyper, Joseph S. Miller & Mariya I. Soskova - 2023 - Journal of Symbolic Logic 88 (3):1083-1102.
    We study the relative computational power of structures related to the ordered field of reals, specifically using the notion of generic Muchnik reducibility. We show that any expansion of the reals by a continuous function has no more computing power than the reals, answering a question of Igusa, Knight, and Schweber [7]. On the other hand, we show that there is a certain Borel expansion of the reals that is strictly more powerful than the reals and such that any Borel (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark