Bi-simulation of epistemic structures: a semantic proof of completeness for Muddy Children Puzzle.

Computational Logic SeminarTuesday, March 24, 20152:00 pmGraduate Center, room 6421

Sergei Artemov

Bi-simulation of epistemic structures: a semantic proof of completeness for Muddy Children Puzzle.

The CUNY Graduate Center

In this talk we discuss truth preserving bi-simulations of multi-agent Kripke models. As an application, we present a semantic proof of the completeness of the syntactic formulation of Muddy Children Puzzle with respect to its standard model.

Professor Artemov holds a Distinguished Professor position at the Graduate Center of the City University of New York, in the Computer Science, Mathematics and Philosophy programs. He is also Professor of Mathematics at Moscow State University, the founder and the Head of the research laboratory Logical Problems in Computer Science. He conducts research in the areas of logic in computer science, mathematical logic and proof theory, knowledge representation and artificial intelligence, automated deduction and verification and optimal control and hybrid systems.

Posted by on March 22nd, 2015