Problem with addition



A problem of addition can be summarised thus

1) To be countable, elements must be alike.
2) Elements that are indistinguishable cannot be counted.

On the face, both statements seem true. Counting is an impossibility. Yet we can count, nevertheless. Indeed, the problem is not confined to counting but to any mathematical manouvure.

It may or may not be wise to search for a resolution to this problem by exploiting the difference between 'alike' and 'indistinguishable'. A difference between 'alike' and 'indistinguishable' has been suggested by Kant who thought that all mathematical entities were temporally placed. Indistinguishable objects that are placed temporally become distinguishable and alike, thus allowing for the existence of mathematics. Temporality of course can be abstractly configured through sequence and order which, we must suppose, are the lynch-pins of any mathematical structure.
.



Relevant Pages

  • Re: Problem with addition
    ... To be countable, elements must be alike. ... mathematics. ... Sophists constantly draw irrelevant distinctions ... Temporality of course can be abstractly configured through ...
    (sci.logic)
  • Re: Problem with addition
    ... exploiting the difference between 'alike' and 'indistinguishable'. ... That would make a mockery of everything Godel was up to." ... device ot move against identical objects. ... mathematics formal presentations.- Hide quoted text - ...
    (sci.logic)
  • Re: Problem with addition
    ... To be countable, elements must be alike. ... Every integer is even or odd. ... Indistinguishable objects that are placed temporally become distinguishable and alike, thus allowing for the existence of mathematics. ... "Understanding Godel isn't about following his formal proof. ...
    (sci.logic)
  • Re: Problem with addition
    ... To be countable, elements must be alike. ... Every integer is even or odd. ... mathematics. ... "Understanding Godel isn't about following his formal proof. ...
    (sci.logic)
  • Re: Problem with addition
    ... To be countable, elements must be alike. ... Counting is an impossibility ... In counting the number of Fs, ... zero problem here -- and certainly no problem that invites empty ...
    (sci.logic)

Quantcast