2000 character limit reached
On the quantifier complexity of definable canonical henselian valuations
Published 25 Nov 2014 in math.LO | (1411.6844v1)
Abstract: We discuss definability in the language of rings without parameters of the unique canonical henselian valuation of a field. We show that in most cases where the canonical henselian valuation is definable, it is already definable by a universal-existential or an existential-universal formula.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.