Diophantine Sets Over Z[ T ]
From MaRDI portal
Publication:4175551
DOI10.2307/2043209zbMath0393.03035OpenAlexW2029283508MaRDI QIDQ4175551
Publication date: 1978
Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2043209
Decidability (number-theoretic aspects) (11U05) Higher degree equations; Fermat's equation (11D41) Applications of computability and recursion theory (03D80) Recursively (computably) enumerable sets and degrees (03D25)
Related Items (7)
The Diophantine Problem for Polynomial Rings and Fields of Rational Functions ⋮ NOTES ON THE DPRM PROPERTY FOR LISTABLE STRUCTURES ⋮ Recursively enumerable sets of polynomials over a finite field ⋮ The logic of pseudo-\(S\)-integers ⋮ On existential definitions of c.e. subsets of rings of functions of characteristic 0 ⋮ Diophantine sets of polynomials over number fields ⋮ On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
This page was built for publication: Diophantine Sets Over Z[ T ]
