A definable henselian valuation with high quantifier complexity
Logic
2015-04-09 v1
Abstract
We give an example of a parameter-free definable henselian valuation ring which is neither definable by a parameter-free -formula nor by a parameter-free -formula in the language of rings. This answers a question of Prestel.
Keywords
Cite
@article{arxiv.1504.01871,
title = {A definable henselian valuation with high quantifier complexity},
author = {Immanuel Halupczok and Franziska Jahnke},
journal= {arXiv preprint arXiv:1504.01871},
year = {2015}
}
Comments
6 pages