Propositional Logics for Three
Tero Tulenheimo, Yde Venema, Dégrémont, C., Keiff, L., Rückert, H. · UvA-DARE (University of Amsterdam) · 2008
Semantics of propositional logic can be formulated in terms of 2-player games of perfect information. In the present paper the question is posed what would a generalization of propositional logic to a 3-player setting look like. Two formulations of such a '3-player propositional logic' are given, denoted PL(3)0 and PL(3). An overview of some metalogical properties of these logics is provided.