Abstract: The theory ACFA admits a primitive recursive quantifier elimination procedure. It is therefore primitive recursively decidable.
Cites work
- A Chevalley theorem for difference equations
- A twisted theorem of Chebotarev
- ACFA and measurability
- Calculability of étale cohomology modulo
- Constructions in Algebra
- Effective counting of the points of definable sets over finite fields
- Field Arithmetic
- Galois stratification and ACFA
- Generic automorphisms of fields
- scientific article; zbMATH DE number 1703931 (Why is no real title available?)
- scientific article; zbMATH DE number 3871511 (Why is no real title available?)
- scientific article; zbMATH DE number 1992950 (Why is no real title available?)
- scientific article; zbMATH DE number 3207354 (Why is no real title available?)
- Model theory of difference fields
- Model theory of endomorphisms of separably closed fields
- Solving diophantine problems over all residue class fields of a number field and all finite fields
- The Manin-Mumford conjecture and the model theory of difference fields
Cited in
(4)
This page was built for publication: Direct twisted Galois stratification
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1676327)