MATHEMATICS, COMPUTER science, SET theory, MATHEMATICAL logic, MODULAR arithmetic
Abstract
The article provides an introduction to infinite hat problems. It sets up a general framework for hat problems of the Gabay-O'Connor type and presents a few results in the finite case. It also presents the Gabay-O'Connor Theorem and a theorem of Lenstran involving strategies that either make every player correct or every player incorrect.