Computable valued fields

Archive for Mathematical Logic 57 (5-6):473-495 (2018)
  Copy   BIBTEX

Abstract

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 sufficient to find such an embedding. By checking that algebraically closed valued fields and p-adically closed valued fields of infinite transcendence degree have the Mal’cev property, we show that they have computable dimension \.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,672

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Stable Embeddedness in Algebraically Closed Valued Fields.E. Hrushovski & A. Tatarsky - 2006 - Journal of Symbolic Logic 71 (3):831 - 862.
Imaginaries in real closed valued fields.Timothy Mellor - 2006 - Annals of Pure and Applied Logic 139 (1):230-279.
Special transformations in algebraically closed valued fields.Yimu Yin - 2010 - Annals of Pure and Applied Logic 161 (12):1541-1564.
Integration in algebraically closed valued fields.Yimu Yin - 2011 - Annals of Pure and Applied Logic 162 (5):384-408.
Henselian valued fields: a constructive point of view.Hervé Perdry - 2005 - Mathematical Logic Quarterly 51 (4):400-416.
A transfer theorem for Henselian valued and ordered fields.Rafel Farré - 1993 - Journal of Symbolic Logic 58 (3):915 - 930.
Existentially closed ordered difference fields and rings.Françoise Point - 2010 - Mathematical Logic Quarterly 56 (3):239-256.
On n-dependent groups and fields.Nadja Hempel - 2016 - Mathematical Logic Quarterly 62 (3):215-224.
d-computable Categoricity for Algebraic Fields.Russell Miller - 2009 - Journal of Symbolic Logic 74 (4):1325 - 1351.
Computable Embeddings and Strongly Minimal Theories.J. Chisholm, J. F. Knight & S. Miller - 2007 - Journal of Symbolic Logic 72 (3):1031 - 1040.
The isomorphism problem for classes of computable fields.Wesley Calvert - 2004 - Archive for Mathematical Logic 43 (3):327-336.

Analytics

Added to PP
2018-07-17

Downloads
8 (#1,312,814)

6 months
4 (#776,943)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

On definable subsets of p-adic fields.Angus MacIntyre - 1976 - Journal of Symbolic Logic 41 (3):605-610.
Cell decomposition for P‐minimal fields.Marie-Hélène Mourgues - 2009 - Mathematical Logic Quarterly 55 (5):487-492.
Algebraic theories with definable Skolem functions.Lou van den Dries - 1984 - Journal of Symbolic Logic 49 (2):625-629.

View all 9 references / Add more references