Recommendations
- Recursively enumerable sets of polynomials over a finite field
- Diophantine sets of polynomials over number fields
- On the Relationship Between Matiyasevich's and Smorynski's Theorems
- Does there exist an algorithm which to each Diophantine equation assigns an integer which is greater than the modulus of integer solutions, if these solutions form a finite set?
- Recursively enumerable sets of polynomials over a finite field are Diophantine
- Diophantine equations and the generalized Riemann hypothesis
- Hilbert’s Tenth Problem and Mazur’s Conjecture for large subrings of $\mathbb {Q}$
- Diophantine undecidability in some rings of algebraic numbers of totally real infinite extensions of \(\mathbb{Q}\)
- Incompleteness of arithmetic from the viewpoint of Diophantine set theory
- The number of solutions of a Diophantine equation over a recursive ring
Cited in
(14)- Diophantine subsets of function fields of curves
- A Diophantine definition of rational integers over some rings of algebraic numbers
- Diophantine sets. Preliminaries
- Recursively enumerable sets of polynomials over a finite field are Diophantine
- On existential definitions of c.e. subsets of rings of functions of characteristic 0
- The number of solutions of a Diophantine equation over a recursive ring
- ON THE SIZE OF SETS IN A POLYNOMIAL VARIANT OF A PROBLEM OF DIOPHANTUS
- A Diophantine Problem for Laurent Polynomial Rings
- Diophantine sets of polynomials over number fields
- A diophantine definition of integers in the rings of rational numbers
- Stockage diophantien et hypothèse abc généralisée
- Diophantine equivalence and countable rings
- NOTES ON THE DPRM PROPERTY FOR LISTABLE STRUCTURES
- Recursively enumerable sets of polynomials over a finite field
This page was built for publication: On Diophantine sets over polynomial rings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4699593)
