[FOM] 176:Count Arithmetic

[Dean Buckner]

Tennant:
> It's a nice teaser to try to give an inductive definition of the
> quantified formulae that would express "there are exactly n k-tuples
> <x1,...,xk> such that F(x1,...,xk)".

Here's a try.  Would something of the following form do:

    There are n+1 objects iff there are n objects and it is the case that p

where "p" expresses the same proposition for every value of n?

Dean