>> The arguments using infinity, including the Differential>>Calculus of Newton and Leibniz, do not require the use of infinite>>sets.>>that is wrong.

Off-hand, I'm not sure how one could prove the FTC otherwise.

>>There are only countably many names.>>Wrong. a name is simply a set of letters of any number.

WM appears to have gotten something rigth.

The set of names, as you defined them, is a countable set. TakingEnglish and the Latin alphabet as an example, we can view each stringas a base-26 encoding of a natural number: a = 1 b = 2... z = 26 aa = 27 ab = 28 az = 52...

So, the set of all possible finite strings can be put in bijection withthe naturals. Therefore, this set is countable.

Since not all of these strings are English words, words are a proper subsetof this, and hence countable.

-- Michael F. Stemper#include <Standard_Disclaimer>Build a man a fire, and you warm him for a day. Set him on fire,and you warm him for a lifetime.