## [Computational Complexity] Voting on Mathematical Truths: The Axiom of Det.

Expand Messages
• One of the founders of Conservapedia (a conservative alternative to Wikipedia) said the following on The Colbert Report: There is an absolute truth. People
Message 1 of 1 , Jan 4, 2010
One of the founders of Conservapedia (a conservative alternative to Wikipedia) said the following on The Colbert Report:
There is an absolute truth. People don't vote on mathematical things like 2+2=4.
Given the source this quote may be ironic. However, this post is not about Conservapedia or Wikipedia. Its about voting on mathematical truths.

There is one kind of math where a vote might be appropriate. Some Set Theorists would like to resolve CH. We already know that this cannot be done in ZFC. So they want to add more axioms. What property should an axiom have? It should be obvious. It is unlikely that we will have new axioms of that type. How about that it be reasonable? Some set theorists think it is reasonable to remove FULL AC and add The Axiom of Determinacy (stated below). I want YOU to VOTE on if it is reasonable.

Definition: Let A be a subset of {0,1}&omega. Let GA be the following game: player I picks b1 &isin {0,1}, then player II picks b2 &isin {0,1}, then player I picks b3 &isin {0,1}, etc. If the final sequence b1 , b2 , b3 ... is in A then I wins. If not then II wins.

Definition: Let A be a subset of {0,1}&omega. A is determined if either player I or II has a winning strategy for GA.

The Axiom of Determinacy (AD): For all sets A that are subsets of {0,1}&omega, A is determined.
1. AD is known to be true for A a Borel Set (Donald Martin proofed that).