Switch to: References

Add citations

You must login to add citations.
  1. Relative decidability and definability in henselian valued fields.Joseph Flenner - 2011 - Journal of Symbolic Logic 76 (4):1240-1260.
    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 (...)
    Direct download (7 more)  
    Export citation  
    Bookmark   1 citation