[lojban-beginners] Re: logical proofs?

[Rob Speer <rspeer@MIT.EDU>]

On Mon, Aug 23, 2004 at 02:47:59PM -0700, Robin Lee Powell wrote:
> > What I'm interested in is whether it is possible that this could be
> > mechanically derived, for example by somebody using a proof assistant
> > such as COQ, but using lojban? I.e are all the steps in the proof
> > mechanical enough to convince a computer that (e.g.) prime numbers are
> > infinite?
> 
> Rob Speer is working on something like this.  Rob?

I haven't thought of using my system as a proof assistant. I don't think doing
so would be especially useful - it would basically just be an awkward frontend
to something like COQ.

My main goal is for my system to do common-sense reasoning, not mathematical
reasoning, because there already is a language perfectly suited for
doing mathematical proofs - the language of math.

-- 
Rob Speer