Pages that link to "Item:Q2464706"
From MaRDI portal
The following pages link to Recursively enumerable sets of polynomials over a finite field are Diophantine (Q2464706):
Displaying 10 items.
- Recursively enumerable sets of polynomials over a finite field (Q875928) (← links)
- Diophantine properties of finite commutative rings (Q1407594) (← links)
- Uniform existential interpretation of arithmetic in rings of functions of positive characteristic (Q2449847) (← links)
- 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? (Q2843817) (← links)
- DIOPHANTINE SETS OF POLYNOMIALS OVER ALGEBRAIC EXTENSIONS OF THE RATIONALS (Q2933672) (← links)
- Diophantine definitions for some polynomial rings (Q3351492) (← links)
- Diophantine sets of polynomials over number fields (Q3581096) (← links)
- On Diophantine sets over polynomial rings (Q4699593) (← links)
- NOTES ON THE DPRM PROPERTY FOR LISTABLE STRUCTURES (Q5070471) (← links)
- Bounded generation and commutator width of Chevalley groups: function case (Q6174371) (← links)