🚀 go-pugleaf

No.  That's what induction is for.  Given a sentence from Person A with
n ands, I can reply with a sentence of k*n ands (where k is a
constant).  Then I prove that 1 and is acceptable, such as "Dogs And
Fish are animals."  Thus, using induction, k*n*p is possible, where p is
any integer you choose, and as p--> infinity, the number of consecutive
ands --> infinity.  QED.

(Math Major...)

GMA


Garry Knight wrote:
> 
> On Sat, 6 Feb 1999 21:56:22 -0000, "Dave" <PiperMcDuff@hotmail.com>
> wrote:
> 
> > Mark Dawes wrote in message <79hveq$jlr$1@news7.svr.pol.co.uk>...
> > >
> > >But
> > >this starts to get somewhat unbelieveable, especially when the publican
> > >writes back again to say ... ]
> 
> > Unbelievable yes, but would this form theoretical proof of a grammatically
> > accurate sentence with an infinite number of ands lined up after each other?
> 
> Wouldn't it take an infinite amount of time to prove this, though?
> 
> --
> Garry Knight
> garry@garryknight.freeserve.co.uk

-- 
To Reach me, remove the obvious from my email addy.