All Questions
Tagged with integer-programming lo.logic
1 question
5
votes
2
answers
734
views
What are the definable sets in Skolem arithmetic?
Definable subsets of $\mathbb N$ in the language of Presburger arithmetic are exactly the eventually periodic sets and quantifier free part corresponds to Integer Programming with linear inequalities ...
- 13.9k