Theorems · Theorem · logic and foundations
FirstOrder.Language.presburger.mul_not_definable
∀ {A : Set ℕ}, ¬A.Definable FirstOrder.Language.presburger {v | v 0 = v 1 * v 2}The graph of multiplication is not Presburger definable in ℕ.
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 109 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites21
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Setstatement and proof · cited by 53,352
- Set.ofPredstatement and proof · cited by 6,101
- Set.imageproof · cited by 5,609
- Set.preimageproof · cited by 4,946
- Set.extproof · cited by 2,266
- FirstOrder.Languageproof · cited by 1,084
- Matrix.vecConsproof · cited by 852
- Matrix.vecEmptyproof · cited by 832
- FirstOrder.Language.Structureproof · cited by 775
- Set.image_congrproof · cited by 533
- Matrix.cons_val_fin_oneproof · cited by 225
- le_max_leftproof · cited by 215
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.