Burden of henselian valued fields in the Denef-Pas language
Peter Sinclair

TL;DR
This paper investigates the complexity measure called burden of henselian valued fields in the Denef-Pas language, showing it equals the sum of the burdens of the value group and residue field, with implications for NTP2, strength, and finite burden.
Contribution
It establishes that the burden of henselian valued fields with relative quantifier elimination equals the sum of the burdens of their value group and residue field, linking model-theoretic properties.
Findings
Burden of henselian valued fields equals sum of burdens of value group and residue field.
Henselian valued fields are NTP2 if and only if both value group and residue field are.
Henselian valued fields are strong and have finite burden under the same conditions.
Abstract
Motivated by the Ax-Kochen/Ershov principle, a large number of questions about henselian valued fields have been shown to reduce to analogous questions about the value group and residue field. In this paper, we investigate the burden of henselian valued fields in the three-sorted Denef-Pas language. If is a theory of henselian valued fields admitting relative quantifier elimination (in any characteristic), we show that the burden of is equal to the sum of the burdens of its value group and residue field. As a consequence, is NTP if and only if its residue field and value group are; the same is true for the statements " is strong" and " has finite burden."
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputability, Logic, AI Algorithms · Advanced Topology and Set Theory · Advanced Algebra and Logic
