Quantifier Elimination For Tame Fields
Franz-Viktor Kuhlmann, Koushik Pal
TL;DR
This paper introduces languages that enable quantifier elimination in the theory of tame fields across all characteristics, advancing the understanding of their logical structure.
Contribution
It provides a framework for quantifier elimination in tame fields, extending previous results to fields of any characteristic.
Findings
Quantifier elimination is achieved for tame fields in specified languages.
The results apply to fields of any characteristic.
This work broadens the scope of model-theoretic analysis of tame fields.
Abstract
In this paper, we give appropriate languages in which the theory of tame fields (of any characteristic) admits (relative) quantifier elimination.
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
TopicsCellular Automata and Applications · Computability, Logic, AI Algorithms · semigroups and automata theory