29 Jun
2006
29 Jun
'06
5:56 p.m.
Since nobody seems to have responded to this, I thought I'd give a hint: Think squares. Franklin T. Adams-Watters -----Original Message----- From: franktaw@netscape.net It is well known that the first-order theory of the non-negative integers with only addition available is decideable, while the theory with addition and multiplication is not. Suppose we have addition and the number of divisors function (often called d(n) or tau(n)). Is the theory then decideable or not? Proof requested. Franklin T. Adams-Watters