3 ms·
His argument against infinities is interesting. He's making an argument for finite constructive mathematics. It's interesting to see that coming around again.
by Animats 3y ago
His argument against infinities is interesting. He's making an argument for finite constructive mathematics.
It's interesting to see that coming around again.
Several decades ago, when I was working on early program proof of correctness, I spent a lot of time with the original Boyer-Moore theorem prover. This is a constructive theory of mathematics, similar to the Piano axioms. It really is possible to have useful mathematics without undecidablity. But you have to give up infinity. Boyer-Moore theory has recursion, but all recursions must have an upper bound. There must be some nonnegative integer that gets smaller with each recursion.
Set theory is possible in the Boyer-Moore system. Boyer and Moore usually added the traditional axioms of set theory. But I tried doing without that to get to a McCarthy-like theory of arrays without set theory first. Arrays had a concrete representation as an ordered sequence of (index, value) tuples. The sequence has to be ordered so that array equality works. So all the functions for operating on arrays are rather clunky. Here's the sequence of machine proofs for that.[3]
Back then, mathematicians hated such approaches. Infinity is a useful trick for handling the edge cases within the main case. Formulas become simpler. You can do things on blackboards with chalk more easily.
Constructive math is boring and kind of ugly, because there's a lot of case analysis.
But it's sound. You can avoid undecidability and Russel's class of all classes paradox.
You don't actually need infinities for much of mathematics.
Today there's more acceptance of machine proofs and case analysis. Everybody has computers, after all.
I'm not a mathematician; I just used formal math as a tool to improve programs.
This is a problem for the theorists.
(A few years ago, I converted the original Boyer-Moore code to run under Gnu Common LISP, so it can be run today.[2] Proving the basics of number theory now takes under a second. It took about 45 minutes in 1981.)
[1] https://sites.math.rutgers.edu/~zeilberg/Opinion160.html https://sites.math.rutgers.edu/~zeilberg/Opinion160.html
[2] https://github.com/John-Nagle/nqthm https://github.com/John-Nagle/nqthm
[3] https://github.com/John-Nagle/pasv/blob/master/src/work/temporaryrulebaseprooflog.txt https://github.com/John-Nagle/pasv/blob/master/src/work/temp...
- YeGoblynQueenne 3y agoThe Piano axioms are the ones used to prove the incompleteness of equal temperament music systems, correct? :P