15 problems
- 0 votes0 replies0 views
Visser's conjecture on the interpretational-theoretic property of Presburger Arithmetic
Presburger Arithmetic, denoted by , is the true theory of natural numbers with addition. A theory is reflexive when it can prove the consistency of all its finitely a…
- 0 votes0 replies1 view
Doubly exponential upper-bound conjecture for VC-dimension of Presburger formulas
Doubly exponential upper-bound conjecture. A doubly exponential upper bound on holds in the general setting.
- 0 votes0 replies0 views
Quantifier elimination with floor functions for parametric Presburger arithmetic
Let and . Define … where each is interpreted by … with when . Quantifier-elimination conjecture. Every…
- 0 votes0 replies0 views
Scott complexity conjecture for Presburger models of infinite linear orders
Let be an infinite linear order. Suppose that , where is one of , , or -. The associa…
- 0 votes0 replies1 view
Tameness of all Ulam expansions
Let be coprime, let denote the expansion of by the associated Ulam predicate, and let be its…
- 0 votes0 replies0 views
Ulam dichotomy for expansions of Presburger arithmetic
Let be coprime, and let be the expansion of by the predicate for the associated Ulam sequence. Ulam dichotomy. For every coprime…
- 0 votes0 replies0 views
The conjectural classification of interpretable orderings in Presburger arithmetic
An interpretable ordering is an ordering definable by an interpretation in Presburger arithmetic; the relevant construction starts with the lexicographic ordering on …
- 0 votes0 replies1 view
NP-hardness conjecture for two-block quadratic Presburger arithmetic
Let be a quadratic scalar. NP-hardness conjecture. Deciding -Presburger arithmetic sentences with two alternating blocks of quantifiers, a fixed number of variable…
- 0 votes0 replies1 view
Undecidability conjecture for three-block Presburger arithmetic with non-quadratic scalar multiplication
Let be a non-quadratic scalar. Undecidability conjecture. -Presburger arithmetic sentences with three alternating blocks of quantifiers are undecidable. The paper…
- 0 votes0 replies0 views
Woods's polynomial-time conjecture for short Presburger sentences
For fixed , consider short Presburger sentences … where the quantifiers alternate, each has fixed dimension, and is a fixed Boolea…
- 0 votes0 replies0 views
Short generating functions have existential and universal Presburger representations
Let be the class of one-variable short generating functions of index at most , and let and…
- 0 votes0 replies1 view
Woods's parametric Frobenius conjecture
Let be a parametric Presburger family, and suppose is finite. Write for its maximum. Woods's parametric Frobenius conjecture. The function…
- 0 votes0 replies1 view
Woods's eventual quasi-polynomiality conjecture for parametric Presburger families
Let range over and fix . A parametric Presburger family is a family of subsets of defined by an inequality … with…
- 0 votes0 replies0 views
Properties of parametric Presburger families
Let be a parametric Presburger family, meaning a family of subsets of definable over the natural numbers using quantifiers, boolean operations, and inequalitie…
- 0 votes0 replies0 views
Parametric Presburger families have quasi-polynomial and rational generating-function behavior
Let be a family of subsets of defined using quantifiers, boolean operations, and inequalities of the form … where ,…