Theorems · Definition · number theory
Dioph
{α : Type u} → Set (α → ℕ) → PropA set S ⊆ ℕ^α is Diophantine if there exists a polynomial on
α ⊕ β such that v ∈ S iff there exists t : ℕ^β with p (v, t) = 0.
- Defined in
- Mathlib.NumberTheory.Dioph
- Cited by
- 30 results in Mathlib
- Foundations
- Depth 11 from the axioms · uses no axioms
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites3
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- DFunLike.coeproof · cited by 62,936
- Setstatement and proof · cited by 53,352
- Polyproof · cited by 31
Cited by32
Results whose statement or proof uses this declaration.
- Dioph.DiophFnproof · cited by 26
- Dioph.extstatement and proof · cited by 12
- Dioph.eq_diophstatement · cited by 8
- Dioph.reindex_diophstatement and proof · cited by 8
- Dioph.interstatement and proof · cited by 6
- Dioph.unionstatement and proof · cited by 6
- Dioph.vec_ex1_diophstatement and proof · cited by 6
- Dioph.diophFn_vecstatement · cited by 5
- Dioph.le_diophstatement · cited by 5
- Dioph.lt_diophstatement · cited by 5
- Dioph.DiophPFunproof · cited by 5
- Dioph.dioph_compstatement and proof · cited by 3