Skolem arithmetic

In mathematical logic, Skolem arithmetic is the first-order theory of the natural numbers with multiplication, named in honor of Thoralf Skolem. The signature of Skolem arithmetic contains only the multiplication operation and equality, omitting the addition operation entirely.

Skolem arithmetic is weaker than Peano arithmetic, which includes both addition and multiplication operations. Unlike Peano arithmetic, Skolem arithmetic is a decidable theory. This means it is possible to effectively determine, for any sentence in the language of Skolem arithmetic, whether that sentence is provable from the axioms of Skolem arithmetic. The asymptotic running-time computational complexity of this decision problem is triply exponential.

Expressive power

First-order logic with equality and multiplication of positive integers can express the relation
$c = a \cdot b$. Using this relation and equality, we can define the following relations on positive integers:
* Divisibility: $b , c \ \Leftrightarrow \ \exists a. c = a \cdot b$
* Greatest common divisor: $d = gcd(a,b) \ \Leftrightarrow \ ((d , a) \land (d , b) \land \forall d'. (((d , a) \land (d , b)) \Rightarrow (d', d))$
* Least common multiple: $m = lcm(a,b) \ \Leftrightarrow \ ((a , m) \land (b , m) \land \forall m'. (((a , m') \land (b , m')) \Rightarrow (m, m'))$
* the constant $1$: $\forall a. (1, a)$
* Prime number: $prime(p) \ \Leftrightarrow\ (p \ne 1) \land \forall a. (a, p) \Rightarrow (a = 1 \lor a = p)$
* Number $b$ is a product of $k$ primes (for a fixed $k$): $\exists a_1,...a_k.\ prime(a_1) \land \ldots \land prime(a_k) \land b = a_1 \cdot \ldots \cdot a_k$
* Number $b$ is a power of some prime: $ppower(b) \ \Leftrightarrow\ \exists p. prime(p) \land (\forall a. ((a \ne 1 \land (a, b)) \Rightarrow (p, a))$
* Number $b$ is a product of exactly $k$ prime powers: $\exists a_1,...a_k.\ ppower(a_1) \land \ldots \land ppower(a_k) \land b = a_1 \cdot \ldots \cdot a_k$

Idea of decidability

The truth value of formulas of Skolem arithmetic can be reduced to the truth value of sequences of non-negative integers constituting their prime factor decomposition, with multiplication becoming point-wise addition of sequences. The decidability then follows from the Feferman–Vaught theorem that can be shown using Quantifier elimination. Another way of stating this is that first-order theory of positive integers is isomorphic to the first-order theory of finite multisets of non-negative integers with the multiset sum operation, whose decidability reduces to the decidability of the theory of elements.

In more detail, according to the fundamental theorem of arithmetic, a positive integer $a > 1$ can be represented as a product of prime powers:
:$a = p_1^p_2^ \cdots$
If a prime number $p_k$ does not appear as a factor, we define its exponent $a_k$ to be zero. Thus, only finitely many exponents are non-zero in the infinite sequence $a_1,a_2,\ldots$. Denote such sequences of non-negative integers by $N^*$.

Now consider the decomposition of another positive number,
:$b = p_1^p_2^ \cdots$
The multiplication $a b$ corresponds point-wise addition of the exponents:
:$a b = p_1^ p_2^ \cdots$
Define the corresponding point-wise addition on sequences by:
:$(a_1,a_2,\ldots) \bar (b_1, b_2, \ldots) = (a_1 + b_1, a_2 + b_2, \ldots)$
Thus we have an isomorphism between the structure of positive integers with multiplication, $(N,\cdot)$ and of point-wise addition of the sequences of non-negative integers in which only finitely many elements are non-zero, $(N^*, \bar)$.

From Feferman–Vaught theorem for first-order logic, the truth value of a first-order logic formula over sequences and pointwise addition on them reduces, in an algorithmic way, to the truth value of formulas in the theory of elements of the sequence with addition, which, in this case, is Presburger arithmetic. Because Presburger arithmetic is decidable, Skolem arithmetic is also decidable.

Complexity

establish, using Ehrenfeucht–Fraïssé games, a method to prove upper bounds on decision problem complexity of weak direct powers of theories. They apply this method to obtain triply exponential space complexity for $(N^*, \bar)$, and thus of Skolem arithmetic.

proves that the satisfiability problem for the ''quantifier-free'' fragment of Skolem arithmetic belongs to the NP complexity class.

Decidable Extensions

Thanks to the above reduction using Feferman–Vaught theorem, we can obtain first-order theories whose open formulas define a larger set of relations if we strengthen the theory of multisets of prime factors. For example, consider the relation $a \sim b$ that is true if and only if $a$ and $b$ have the equal number of distinct prime factors:
:$, \ , \ = \ , \ ,$
For example, $2^ \cdot 3^ \sim 5^8 \cdot 19^9$ because both sides denote a number that has two distinct prime factors.

If we add the relation $\sim$ to Skolem arithmetic, it remains decidable. This is because the theory of sets of indices remains decidable in the presence of the equinumerosity operator on sets, as shown by the Feferman–Vaught theorem.

Undecidable extensions

An extension of Skolem arithmetic with the successor predicate, $succ(n)=n+1$ can define the addition relation using Tarski's identity:
:$(c = 0 \lor c = a + b) \Leftrightarrow (ac + 1)(bc + 1) = c^2 (ab + 1) + 1$
and defining the relation $c = a + b$ on positive integers by
:$succ(ac) succ(bc) = succ(c^2 succ(ab))$
Because it can express both multiplication and addition, the resulting theory is undecidable.

If we have an ordering predicate on natural numbers (less than, $<$), we can express $succ$ by
:$succ(a) = b \ \Leftrightarrow \ a < b \land \forall c. (a < c \Rightarrow (b = c \lor b < c))$
so the extension with $<$ is also undecidable.

See also

*Presburger arithmetic
*Robinson arithmetic
*Quantifier elimination

References

Bibliography

*

*

*

*

*

*

{{Refend

Formal theories of arithmetic