Learn More
We shall introduce in this paper a language whose formulas will be interpreted by games of imperfect information. Such games will be defined in the same way as the games for first-order formulas except that the players do not have complete information of the earlier course of the game. Some simple logical properties of these games will be stated together(More)
We study partiality in propositional logics containing formulas with either undefined or over-defined truth-values. Undefined values are created by adding a four-place connective W termed transjunction to complete models which, together with the usual Boolean connectives is shown to be functionally complete for all partial functions. Transjunction is seen(More)
GAMES IN PHILOSOPHICAL LOGIC * Semantic games are an important evaluation method for a wide range of logical languages, and are frequently resorted to when traditional methods do not easily apply. A case in point is a family of independence-friendly (IF) logics, allowing regulation over information flow in formulas, amounting to the failure of perfect(More)