Solving diophantine problems over all residue class fields of a number field and all finite fields

DOI10.2307/1971045zbMath0376.02042OpenAlexW2052260583WikidataQ59664836 ScholiaQ59664836MaRDI QIDQ1245823

George S. Sacerdote, Michael D. Fried

Publication date: 1976

Published in: Annals of Mathematics. Second Series (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/fd0943157f7a58ceed11d39d4cefd7bb37565b74

Mathematics Subject Classification ID

Decidability (number-theoretic aspects) (11U05) Model-theoretic algebra (03C60) Connections between field theory and logic (12L99) Diophantine equations in many variables (11D72) Applications of computability and recursion theory (03D80) Arithmetic theory of polynomial rings over finite fields (11T55) Arithmetic problems in algebraic geometry; Diophantine geometry (14G99) Software, source code, etc. for problems pertaining to mathematical logic and foundations (03-04) Software, source code, etc. for problems pertaining to field theory (12-04)

Related Items (25)

Substructures and uniform elimination for p-adic fields ⋮ Model theory of finite fields and pseudo-finite fields ⋮ Extensions of Hilbert's tenth problem ⋮ Direct twisted Galois stratification ⋮ Between the Rings $${\mathbb Z}/p^n{\mathbb Z}$$ and the Ring $${\mathbb Z}_p$$: Issues of Axiomatizability, Definability and Decidability ⋮ A generalization of the Artin‐Tschebotareff density theorem in positive characteristic ⋮ Variables separated equations: strikingly different roles for the branch cycle lemma and the finite simple group classification ⋮ Twisted Galois stratification ⋮ Frattini covers and projective groups without the extension property ⋮ Definable sets, motives and 𝑝-adic integrals ⋮ A uniform method for proving lower bounds on the computational complexity of logical theories ⋮ Embedding covers and the theory of Frobenius fields ⋮ Polynomials with roots modulo every integer ⋮ Computational complexity of sentences over fields ⋮ On polynomial-factorial diophantine equations ⋮ Galois stratification and ACFA ⋮ Arcs and resolution of singularities ⋮ Galois stratification over Frobenius fields ⋮ Model theory of adeles. I. ⋮ Sentences over integral domains and their computational complexities ⋮ Algorithms determining finite simple images of finitely presented groups ⋮ A note on principal ideals and smooth curves ⋮ The place of exceptional covers among all diophantine relations ⋮ Effective counting of the points of definable sets over finite fields ⋮ Galois stratification over \(e\)-fold ordered Frobenius fields

This page was built for publication: Solving diophantine problems over all residue class fields of a number field and all finite fields