Ideas for an Algebraic Treatment of the Russian Cards Problem

erschienen 2011 in H. de Swart (eds.): Relational and Algebraic Methods in Computer Science PhD Programme (RAMiCS 12), 2011.

Abstract: Logical puzzles are an interesting field for evaluating logical calculi. We try to formalise the Russian Cards Problem using an algebraisation based on a boolean semiring and algebraic knowledge operators. With this, we are able to formulate some of the properties of the puzzle. Furthermore we make a proposal for updates which destroy knowledge. This is needed in the puzzle because a proposition like “agent b does not know a’s cards” has to be revised as soon as a announces her cards.