Relative decidability and definability in Henselian valued fields

From MaRDI portal
Publication:3107352

DOI10.2178/JSL/1318338847zbMATH Open1237.03022arXiv0910.2682OpenAlexW2962846764MaRDI QIDQ3107352FDOQ3107352


Authors: Joseph Flenner Edit this on Wikidata


Publication date: 23 December 2011

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Abstract: 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.


Full work available at URL: https://arxiv.org/abs/0910.2682




Recommendations




Cites Work


Cited In (16)





This page was built for publication: Relative decidability and definability in Henselian valued fields

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3107352)