Statements (13)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:characterizedBy |
existence of integer solutions to polynomial equations
|
| gptkbp:defines |
A set of n-tuples of integers for which there exists a polynomial with integer coefficients such that the set consists of all n-tuples for which the polynomial has an integer solution.
|
| gptkbp:equivalentTo |
listable set (recursively enumerable set)
|
| gptkbp:field |
number theory
|
| gptkbp:importantFor |
gptkb:Hilbert's_tenth_problem
|
| gptkbp:namedAfter |
gptkb:Diophantus
|
| gptkbp:relatedTo |
gptkb:Diophantine_equation
recursively enumerable set |
| gptkbp:studiedBy |
gptkb:Yuri_Matiyasevich
|
| gptkbp:bfsParent |
gptkb:Diophantus
|
| gptkbp:bfsLayer |
7
|
| https://www.w3.org/2000/01/rdf-schema#label |
Diophantine set
|