Stuart_Armstrong comments on The Last Number - Less Wrong

4 Post author: Stuart_Armstrong 10 April 2010 12:09PM

You are viewing a comment permalink. View the original post to see all comments and the full post content.

Comments (57)

You are viewing a single comment's thread. Show more comments above.

Comment author: Stuart_Armstrong 10 April 2010 04:50:35PM 0 points [-]

Look up: http://en.wikipedia.org/wiki/Self-verifying_theories

"for instance there are self-verifying systems capable of proving the consistency of Peano arithmetic."

Comment author: cousin_it 10 April 2010 06:49:38PM 4 points [-]

Interesting. Why would one want a theory that can prove its own consistency? This doesn't really tell us anything, because inconsistent theories can prove any statement, including their own consistency.

Comment author: Academian 10 April 2010 08:58:35PM 1 point [-]

I don't agree that it doesn't tell us anything ... an inconsistent theory can prove all statements, yes, but not all with proofs shorter than its shortest proof of a contradiction. That is, if Peano arithmetic has a trillion-line proof that 3.2 is an integer, then it can prove anything in about a trillion and two lines... but it can't prove everything as easily as say (1+1+1)(1+1)=(1+1+1+1+1+1). It might be something special when a theory can prove its own consistency elegantly, sort of the way a human can have non-zero credence that s/he is usually rational.

Comment author: Jack 10 April 2010 08:04:32PM 0 points [-]

I'm not sure I know what a proof of consistency is, except that I wouldn't want an inconsistent theory to be capable of one.

Comment author: Stuart_Armstrong 10 April 2010 09:27:19PM *  0 points [-]

An inconsistent theory can prove anything - including its own consistency.

Comment author: Jack 10 April 2010 10:13:49PM 0 points [-]

I'm familiar with "anything statement can be derived from an inconsistent theory" but I really am confused by how any such derivation could be a proof of consistency. If proofs of consistency are possible for inconsistent theories then how exactly are they proofs of consistency?

Comment author: CronoDAS 10 April 2010 11:04:32PM 3 points [-]

It's a "proof" in that it follows the formal rules of the proof system. You can "prove" anything if your rules are sufficiently ridiculous, but that doesn't mean the proof actually means anything.

Comment author: Jack 11 April 2010 01:18:38AM 0 points [-]

Thanks.

Comment author: Stuart_Armstrong 10 April 2010 11:15:14PM 0 points [-]

If I tell the truth, I cannot say: "I lie".

But if I lie, I can say: "I tell the truth".

Comment author: Tyrrell_McAllister 10 April 2010 11:27:30PM 0 points [-]

So, a theory's proving its own consistency is strong Bayesian evidence that it's inconsistent ;).

Comment author: Stuart_Armstrong 11 April 2010 07:48:29AM 0 points [-]

If that's all you know about the theory, I'd say yes - but not "strong" evidence.

Comment author: Tyrrell_McAllister 11 April 2010 01:59:27PM 0 points [-]

I probably should have given more than just a winkie to indicate that I was joking.

Comment author: Stuart_Armstrong 11 April 2010 08:52:42PM 0 points [-]

Actually, it is a serious point. If you choose thories at random, according to some universal prior, then a lot of them are going to be inconsistent. And most of the theories that can quickly prove their own consistency are the inconsistent ones. So this does provide some information (depending on how the consistency proof was arrived at, of course).

Comment author: Tyrrell_McAllister 11 April 2010 09:04:03PM 1 point [-]

That was pretty much what I was getting at. But since I'm not in a position to quantify how strong the evidence is, I took the cheap route of making it a joke :).

Comment author: Academian 10 April 2010 05:16:21PM 0 points [-]

Huh, did not know! Unfortunately they don't imply the results of Peano arithmetic, but that would be asking for too much, heheh.