English

Computable valued fields

Logic 2017-09-29 v2

Abstract

We investigate the computability-theoretic properties of valued fields, and in particular algebraically closed valued fields and pp-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 pp-adic field which does not embed into any computable pp-adic closure, but we give an effectiveness condition on the divisibility relation in the value group which is sufficient to find such an embedding. By checking that algebraically closed valued fields and pp-adically closed valued fields of infinite transcendence degree have the Mal'cev property, we show that they have computable dimension ω\omega.

Keywords

Cite

@article{arxiv.1602.08408,
  title  = {Computable valued fields},
  author = {Matthew Harrison-Trainor},
  journal= {arXiv preprint arXiv:1602.08408},
  year   = {2017}
}

Comments

21 pages

R2 v1 2026-06-22T12:58:46.041Z