Relative decidability and definability in henselian valued fields

Details Relative decidability and definability in henselian valued fields Relative decidability and definability in henselian valued fields

2009-10-14

arxiv.org/abs/0910.2682v1

J. Symbolic Logic 76 (2011), no. 4, 1240--1260

Mathematics

Logic

20 pages

Scientific paper

Let K 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. 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.

Affiliated with

Also associated with

No associations

Rating

Relative decidability and definability in henselian valued fields does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Relative decidability and definability in henselian valued fields, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Relative decidability and definability in henselian valued fields will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-19681