Undecidability of some elementary theories over PAC fields
From MaRDI portal
We consider the theory of the field \(\tilde Q\) of algebraic numbers equipped with \(n\geq 2\) automorphisms \(\sigma_ 1,...,\sigma_ n\). We show that with probability 1 (in the sense of Haar measure on Gal\((\tilde Q/Q))\) this theory has the complexity of arithmetic. We use torsion points on elliptic curves to encode finite sets. The methods work also in nonzero characteristic.
Recommendations
Cites work
- Algebraic extensions of finite corank of Hilbertian fields
- An analogue of Čebotarev density theorem for fields of finite corank
- Bounded statements in the theory of algebraically closed fields with distinguished automophisms.
- Diophantine Equations with Special Reference To Elliptic Curves
- Elementary Statements Over Large Algebraic Fields
- Galois stratification over Frobenius fields
- scientific article; zbMATH DE number 3769606 (Why is no real title available?)
- scientific article; zbMATH DE number 3233758 (Why is no real title available?)
- scientific article; zbMATH DE number 3291134 (Why is no real title available?)
- scientific article; zbMATH DE number 3309800 (Why is no real title available?)
- scientific article; zbMATH DE number 3316928 (Why is no real title available?)
- scientific article; zbMATH DE number 3335234 (Why is no real title available?)
- scientific article; zbMATH DE number 3188124 (Why is no real title available?)
- Number of Points of Varieties in Finite Fields
- Roots of unity over large algebraic fields
- The elementary theory of algebraic fields of finite corank
- The elementary theory of finite fields
- Torsion points of elliptic curves over large algebraic extensions of finitely generated fields
Cited in
(7)- Undecidability of the theory of finite nearfields
- The elementary theory of \(\omega\)-free \(Ax\) fields
- On von Neumann regular rings with an automorphism
- scientific article; zbMATH DE number 4014840 (Why is no real title available?)
- The undecidability of cyclotomic towers
- UNDECIDABILITY OF FAMILIES OF RINGS OF TOTALLY REAL INTEGERS
- Back-and-forth systems for generic curves and a decision algorithm for the limit theory
This page was built for publication: Undecidability of some elementary theories over PAC fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1074575)