Propositional Logic of Imperfect Information: Foundations and Applications

  title={Propositional Logic of Imperfect Information: Foundations and Applications},
  author={Ahti-Veikko Pietarinen},
  journal={Notre Dame J. Formal Log.},
  • A. Pietarinen
  • Published 20 October 2001
  • Philosophy
  • Notre Dame J. Formal Log.
I will show that the semantic structure of a new imperfectinformation propositional logic can be described in terms of extensive forms of semantic games. I will discuss some ensuing properties of these games such as imperfect recall, informational consistency, and team playing. Finally, I will suggest a couple of applications that arise in physics, and most notably in quantum theory and quantum logics. 

Figures from this paper

Equilibrium Semantics for IF Logic and Many-Valued Connectives
It is proved that already on the propositional level all rational truth values can be obtained as equilibrium values.
Semantic games with chance moves revisited: from IF logic to partial logic
It is observed that IF propositional logic proposed by Sandu and Pietarinen can be equivalently translated to partial logic, which implies that imperfect information may not be necessary for IF propositionally logic.
Independence-Friendly Logic and Games of Incomplete Information
The purpose of the present paper is to extend the core idea of ‘ifing’ different logics to a new domain, and suggest another type of independence.
Semantic Games In Logic and Epistemology
  • A. Pietarinen
  • Philosophy
    Logic, Epistemology, and the Unity of Science
  • 2004
The purpose of this paper is to introduce the reader to game-theoretic semantics (GTS), and to chart some of its current directions, with a focus on epistemological issues. GTS was originally
Common Knowledge of Rationality in Extensive Games
We develop a logical system that captures two different interpretations of what extensive games model, and we apply this to a long-standing debate in game theory between those who defend the claim
The Intrinsic Quantum Nature of Nash Equilibrium Mixtures
This paper establishes a fundamental connection between n-person normal form games and quantum mechanics (QM), which eliminates the conceptual problems of these random strategies and demonstrates that there is an intrinsic limitation to the predictions of game theory, on a par with the “irreducible randomness” of quantum physics.
Axiomatizing Japaridze's approach to propositional IF logic
A formal system sound and complete w.r.t. the propositional fragment of Japaridze’s cirquentbased semantics for IF logic can be considered an axiomatization of purely propositional IF logic in its full generality.
From Mitchell to Carus: Fourteen Years of Logical Graphs in the Making
Abstract: We analyze the steps that took Peirce from his early 1882 proposals to represent logic by graphs to the advent of the full theory of quantification in his 1896 logic of Existential Graphs.
A cirquent calculus system with clustering and ranking
An analysis of Existential Graphs–part 2: Beta
This paper provides an analysis of the notational difference between Beta Existential Graphs, the graphical notation for quantificational logic invented by Charles S. Peirce at the end of the 19th


On the logic of informational independence and its applications
  • G. Sandu
  • Computer Science, Economics
    J. Philos. Log.
  • 1993
A language whose formulas will be interpreted by games of imperfect information, 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 is introduced.
Quantum Logic and Quantum Theory in a Game-Theoretic Perspective
Extensive games of imperfect information, together with the associated semantic machinery, can be brought to bear on logical aspects of quantum-theoretic phenomena. Among other things, this kinship
Partiality and Games: Propositional Logic
Transjunction is seen to be motivated from a game-theoretic perspective, emerging from a two-stage extensive form semantic game of imperfect information between two players, where partiality is generated as a property of non-determinacy of games.
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
On the Problem of Hidden Variables in Quantum Mechanics
The demonstrations of von Neumann and others, that quantum mechanics does not permit a hidden variable interpretation, are reconsidered. It is shown that their essential axioms are unreasonable. It
Charting the Labyrinth of Quantum Logics: A Progress Report
Quantum logic traces to the investigations of Birkhoff and von Neumann1* who suggested that the (closed) subspaces of a (separable) Hilbert space may be interpreted as representing the propositions
The principles of mathematics revisited
1. The functions of logic and the problem of truth definition 2. The game of logic 3. Frege's fallacy foiled: Independence-friendly logic 4. The joys of independence: Some uses of IF logic 5. The
Quantum Formulation of Classical Two Person Zero-Sum Games
The concept of a classical player, corresponding to a simple random variable on a finite cardinality probability space, is shown to extend to that of a quantum player, corresponding to a self-adjoint
Is Logic Empirical
I want to begin by considering a case in which ‘necessary’ truths (or rather ‘truths’, turned out to be falsehoods: the case of Euclidean geometry. I then want to raise the question: could some of
Logic of Quantum Mechanics
“When we go far in the direction of the very small, quantum theory says that our forms of thought fail, so that it is questionable whether we can properly think at all”. These words of Bridgman