Comments on: The mathematical truth is out there…

By: As revisões na verdade não são de verdade « Pesquisando e aprendendo

As revisões na verdade não são de verdade « Pesquisando e aprendendo — Wed, 28 Jul 2010 02:37:49 +0000

[...] clipped from slawekk.wordpress.com [...]

By: slawekk

slawekk — Mon, 04 Aug 2008 17:50:59 +0000

My first question would be whether you think it would be worth it to build on top of Isabelle as an engine, or if I might as well just write my own basic logic engine.

I suggest using Isabelle, or one of other existing theorem proving environments. A bunch of provers are described in Freek Wiedijk's Seventeen Provers of the World> . Do try a couple of them, it is an effort well spent. If you really want to limit yourself to Peano Arithmetic, Metamath has a starting setup for that (called peano.mm). Otherwise, my personal favourite is Isabelle ZF.

By: pdf23ds

pdf23ds — Sat, 02 Aug 2008 21:02:45 +0000

I don’t have a lot of mathematical training, but I’m interested in getting back in and learning a bunch. But I hate the feeling of never knowing if the little doodles I’m doing contain a mistake or not. So a while ago I started writing a program that would let me manipulate mathematical statements efficiently and easily while also providing a formal proof that the manipulations were valid. Unfortunately, I lack the training to reduce it all to peano arithmetic. I wonder whether you might be able to give me some direction in how to go about it.

The first field I want to tackle is calculus. I made it through calculus 1 in college with an A, so I’m already pretty familiar with the first several chapters of my Shaum’s guide to calculus. But I want to be able to represent all the proofs presented in it in my program.

My first question would be whether you think it would be worth it to build on top of Isabelle as an engine, or if I might as well just write my own basic logic engine.