Decidable Fragment of Theories in Field Arithmetic
Chun-Yu Lin

TL;DR
This paper establishes the decidability of certain logical theories related to Hilbertian and PAC fields in characteristic 0, advancing the understanding of their logical properties.
Contribution
It proves the decidability of specific $orall^1 orall^1$ and $orall^1 exists^1$ theories for classes of Hilbertian and PAC fields in characteristic 0, which was previously unknown.
Findings
Decidability of $orall^1 orall^1$ theories for Hilbertian fields with characteristic 0.
Decidability of $orall^1 exists^1$ theories for Hilbertian and PAC fields in characteristic 0.
Extension of decidability results to perfect Hilbertian fields.
Abstract
In this paper, we show that the theories of Hilbertian fields with charateristic 0 and perfect Hilbertian fields are both decidable. We also prove that the theories of Hilbertian fields with charateristic 0, Hilbertian fields, PAC fields with characteristic 0, and PAC fields are all decidable.
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 · Benford’s Law and Fraud Detection · Polynomial and algebraic computation
