Reasoning About Knowledge of Unawareness

Awareness has been shown to be a useful addition to standard epistemic logic for many applications. However, standard propositional logics for knowledge and awareness cannot express the fact that an agent knows that there are facts of which he is unaware without there being an explicit fact that the agent knows he is unaware of. We propose a logic for reasoning about knowledge of unawareness, by extending Fagin and Halpern's \emph{Logic of General Awareness}. The logic allows quantification over variables, so that there is a formula in the language that can express the fact that ``an agent explicitly knows that there exists a fact of which he is unaware''. Moreover, that formula can be true without the agent explicitly knowing that he is unaware of any particular formula. We provide a sound and complete axiomatization of the logic, using standard axioms from the literature to capture the quantification operator. Finally, we show that the validity problem for the logic is recursively enumerable, but not decidable.Comment: 32 page

Theorems and unawareness

This paper provides a set-theoretic model of knowledge and unawareness, in which reasoning through theorems is employed. A new property called Awareness Leads to Knowledge shows that unawareness of theorems not only constrains an agent's knowledge, but also, can impair his reasoning about what other agents know. For example, in contrast to Li (2006), Heifetz, Meier, and Schipper (2006) and the standard model of knowledge, it is possible that two agents disagree on whether another agent knows a particular event

A logic for reasoning about knowledge of unawareness

In the most popular logics combining knowledge and awareness, it is not possible to express statements about knowledge of unawareness such as “Ann knows that Bill is aware of something Ann is not aware of” – without using a stronger statement such as “Ann knows that Bill is aware of p and Ann is not aware of p”, for some particular p. In Halpern and Rêgo (2006, 2009b) (revisited in Halpern and Rêgo (2009a, 2013)) Halpern and Rêgo introduced a logic in which such statements about knowledge of unawareness can be expressed. The logic extends the traditional framework with quantification over formulae, and is thus very expressive. As a consequence, it is not decidable. In this paper we introduce a decidable logic which can be used to reason about certain types of unawareness. Our logic extends the traditional framework with an operator expressing full awareness, i.e., the fact that an agent is aware of everything, and another operator expressing relative awareness, the fact that one agent is aware of everything another agent is aware of. The logic is less expressive than Halpern’s and Rêgo’s logic. It is, however, expressive enough to express all of the motivating examples in Halpern and Rêgo (2006, 2009b). In addition to proving that the logic is decidable and that its satisfiability problem is PSPACE-complete, we present an axiomatisation which we show is sound and complete

Unawareness of theorems

This paper provides a set-theoretic model of knowledge and unawareness. A new property called Awareness Leads to Knowledge shows that unawareness of theorems not only constrains an agent's knowledge, but also, can impair his reasoning about what other agents know. For example, in contrast to Li (2006), Heifetz et al. (2006a) and the standard model of knowledge, it is possible that two agents disagree on whether another agent knows a particular event. The model follows Aumann (1976) in defining common knowledge and characterizing it in terms of a self-evident event, but departs in showing that no-trade theorems do not hold.

Modeling Unawareness in Arbitrary State Spaces

I develop a set-theoretic model of unawareness without making any structural assumptions on the underlying state space. Unawareness is characterized as a measurability constraint that results in players' reasoning about a “coarse" subjective algebra of events. The model is shown to be essentially equivalent to the product model in Li (2007), indicating that such a measurability constraint can be captured by restrictions on the dimensions of the state space without loss of generality. I use a variant of the partition model to examine the case of partial unawareness, where the player is aware of a question but unaware of some possible answers to that question, and characterize the player's knowledge hierarchies from his subjective perspective.unawareness, partial unawareness, information, information partition, the state space

Standard State Space Models of Unawareness

The impossibility theorem of Dekel, Lipman and Rustichini has been thought to demonstrate that standard state-space models cannot be used to represent unawareness. We first show that Dekel, Lipman and Rustichini do not establish this claim. We then distinguish three notions of awareness, and argue that although one of them may not be adequately modeled using standard state spaces, there is no reason to think that standard state spaces cannot provide models of the other two notions. In fact, standard space models of these forms of awareness are attractively simple. They allow us to prove completeness and decidability results with ease, to carry over standard techniques from decision theory, and to add propositional quantifiers straightforwardly

Alternative Semantics for Unawareness

Modica and Rustichini [Theory and Decision 37, 1994] provided a logic for reasoning about knowledge where agents may be unaware of certain propositions. However, their original approach had the unpleasant property that nontrivial unawareness was incompatible with partitional information structures. More recently, Modica and Rustichini [Games and Economic Behavior 27:2, 1999] have provided an approach that allows for nontrivial unawareness in partitional information structures. Here it is shown that their approach can be viewed as a special case of a general approach to unawareness considered by Fagin and Halpern [Artificial Intelligence 34, 1988].awareness, unawareness,

Quantum Penny Flip game with unawareness

Games with unawareness model strategic situations in which players' perceptions about the game are limited. They take into account the fact that the players may be unaware of some of the strategies available to them or their opponents as well as the players may have a restricted view about the number of players participating in the game. The aim of the research is to introduce this notion into theory of quantum games. We shall focus on PQ Penny Flip game introduced by D. Meyer. We shall formalize the previous results and consider other cases of unawareness in the game

A reasoning approach to introspection and unawareness

We introduce and study a unified reasoning process which allows to represent the beliefs of both a fully rational agent and of an unaware one. This reasoning process provides natural properties to introspection and unawareness. The corresponding model for the rational or boundedly rational agents is both easy to describe and to work with, and the agent’s full system of beliefs has natural descriptions using a reduced number of parameters.Economics (Jel: A)

Preference-Dependent Unawareness

Morris (1996, 1997) introduced preference-based definitions of knowledge of belief in standard state-space structures. This paper extends this preference-based approach to unawareness structures (Heifetz, Meier, and Schipper, 2006, 2008). By defining unawareness and knowledge in terms of preferences over acts in unawareness structures and showing their equivalence to the epistemic notions of unawareness and knowledge, we try to build a bridge between decision theory and epistemic logic. Unawareness of an event is behaviorally characterized as the event being null and its negation being null.Unawareness, awareness, knowledge, preferences, subjective expected utility theory, decision theory, null event