I believe this is a tautology. It is true by the definition of integers (which you provide in the statement itself). It therefore doesn't make a statement about non-existence, but rather, the quality of integers.
Secondly, just because something is a tautology, does not mean it is not a statement about non-existence.
Also don't forget to say 'nonzero'.
That proof relies on induction which in turn relies on the existence of infinity. To see how infinity is necessary, assume there are not infinite integers. Let X be the highest positive integer and multiply it by 2, the result does not exist.
> Also don't forget to say 'nonzero'.
I did forget :), thanks
>Let X be the highest positive integer
That contradicts the definition of integer, so it doesn't really show anything.
Pretty much all I need for the proof is a working successor function, and if you take away the successor function you have something that doesn't even resemble integers.
What do you mean by unbounded? If you mean something like a 64 bit integer that loops around to negatives eventually, then the statement either "every (non-zero) integer is a factor of another integer" is no longer true.
> That contradicts the definition of integer, so it doesn't really show anything.
Which definition does it contradict?
> Pretty much all I need for the proof is a working successor function, and if you take away the successor function you have something that doesn't even resemble integers.
You can have a successor function, but if you can only apply it a finite number of times if you don't have infinity.
There is no largest integer.
> If you mean something like a 64 bit integer that loops around to negatives eventually, then the statement either "every (non-zero) integer is a factor of another integer" is no longer true.
Sort of, it depends on how you define factor. What stops me from factoring -4 into 4 * 63?
> Which definition does it contradict?
Where you take counting numbers and add 0 and negatives. If you reach a point where you can't count more, you screwed something up.
> You can have a successor function, but if you can only apply it a finite number of times if you don't have infinity.
When you give me an integer n, I only need to apply the successor function n times to provide your factoring example. No problem there.
For, example you can prove "there is no integer that is not a factor of another integer".
Or another example, my first example disproves your negative statement "you cannot prove the non-existence of something".
I do agree that you can't disprove the existence of God, but that has nothing to do with induction or the rules of logic. I think that has much more to do with the semantic and cultural difficulty of adequately defining "God" in a way or ways that satisfy everyone and contain sufficient referential specificity to be disprovable.