None of the posts linked to from the ADT page resolve my concern, which is this: if you have two ADT agents playing the prisoner’s dilemma, unless they use very similar theorem provers there is no way they can cooperate.
My point was that in principle they can cooperate, and the reasons for difficulty in arranging cooperation in practice are not related to incompleteness. Considering conditional statements gets rid of the incompleteness-related problems.
My point was that in principle they can cooperate, and the reasons for difficulty in arranging cooperation in practice are not related to incompleteness. Considering conditional statements gets rid of the incompleteness-related problems.