[FOM] AI-completeness

hendrik@topoi.pooq.com hendrik at topoi.pooq.com
Thu May 3 13:26:29 EDT 2007

On Tue, May 01, 2007 at 06:49:04PM -0400, joeshipman at aol.com wrote:
> Very clever! At first, one might think this game was trivial to play 
> because an optimal strategy for each player would be to add an axiom 
> saying that the current set of axioms is consistent. But it is more 
> interesting because of the possibility of bluffing -- you can add an 
> axiom you have constructed to be inconsistent, but that you think your 
> opponent will not be able to detect the inconsistency of, then pounce 
> on him if he lazily asserts that your axiom is consistent.

Yes.  I very carefully formulated it so that bluffing was a 

-- hendrik

More information about the FOM mailing list