Theorems · Theorem · logic and foundations
FirstOrder.Language.presburger.definable_iff_isSemilinearSet
∀ {α : Type u_1} {A : Set ℕ} [Finite α] {s : Set (α → ℕ)},
A.Definable FirstOrder.Language.presburger s ↔ IsSemilinearSet sA set is Presburger definable in ℕ if and only if it is semilinear.
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 107 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- Finite
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites12
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.Elemproof · cited by 7,166
- Set.ofPredproof · cited by 6,101
- Finitestatement and proof · cited by 3,029
- FirstOrder.Language.withConstantsproof · cited by 108
- FirstOrder.Language.Formulaproof · cited by 93
- FirstOrder.Language.Formula.Realizeproof · cited by 81
- IsSemilinearSetstatement and proof · cited by 44
- Set.Definablestatement and proof · cited by 39
- FirstOrder.Language.presburgerstatement and proof · cited by 21
- IsSemilinearSet.definableproof · cited by 1
Cited by1
Results whose statement or proof uses this declaration.
- FirstOrder.Language.presburger.definable₁_iff_ultimately_periodicproof · cited by 1