Hostname: page-component-7b7567c8c-z4zkx Total loading time: 0 Render date: 2026-11-16T16:07:00.567Z Has data issue: false hasContentIssue false

Relative decidability and definability in henselian valued fields

Published online by Cambridge University Press:  12 March 2014

Joseph Flenner*
Affiliation:
University of Notre Dame, Department of Mathematics, 255 Hurley Hall, Notre Dame, IN 46556, USA, E-mail: jflenner@nd.edu

Abstract

Let (K, v) be a henselian valued field of characteristic 0. Then K admits a definable partition on each piece of which the leading term of a polynomial in one variable can be computed as a definable function of the leading term of a linear map. The main step in obtaining this partition is an answer to the question, given a polynomial f(x) ∈ K[x], what is v(f(x))?

Two applications are given: first, a constructive quantifier elimination relative to the leading terms, suggesting a relative decision procedure; second, a presentation of every definable subset of K as the pullback of a definable set in the leading terms subjected to a linear translation.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 2011

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable