Wei_Dai comments on Decision Theories, Part 3.75: Hang On, I Think This Works After All - Less Wrong

23 Post author: orthonormal 06 September 2012 04:23PM

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

Article Navigation

Comments (45)
Tags: tdt decision_theory prisoners_dilemma timeless

Comments (45)

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

Comment author: Wei_Dai 16 September 2012 07:56:34AM *  2 points [-]

Another question is, what if we had two proof systems, neither of which encompasses the other? (Most horrifyingly, what if one were PA plus the Gödel sentence of PA, and the other were PA plus the negation of the Gödel sentence?)

I think that works too. Call these proof systems PA+ and PA- and the FairBots using them FB+ and FB-. PA can prove that any theorem of PA is also a theorem of PA+ and PA-. So PA can prove:

  1. "FB+(FB-)=C" is provable in PA implies "FB+(FB-)=C" is provable in PA-
  2. "FB+(FB-)=C" is provable in PA implies FB-(FB+)=C (using 1 and looking at FB-)

and similarly for the other half of the Löbian circle. So FB+(FB-)=C and FB-(FB+)=C are theorems of PA and hence theorems of PA- and PA+.

Powered by Reddit Powered by Reddit