  An \(n\)-agent possible world justification model is a structure  \(\langle \mathcal{G} , \mathcal{R}_{1}\), …,\(\mathcal{R}_{n}  , \mathcal{R} , \mathcal{E} , \mathcal{V}\rangle\) meeting the  following conditions.  \(\mathcal{G}\) is a set of possible  worlds. Each of \(\mathcal{R}_{1}\),…,\(\mathcal{R}_{n}\) is  an accessibility relation, one for each agent. These may be assumed  to be reflexive, transitive, or symmetric, as desired. They are used  to model implicit agent knowledge for the family of agents. The  accessibility relation \(\mathcal{R}\) meets the \(\mathsf{LP}\)  conditions, reflexivity and transitivity. It is used in the modeling  of explicit knowledge.  \(\mathcal{E}\) is an evidence function,  meeting the same conditions as those for \(\mathsf{LP}\) in Section  3.3. \(\mathcal{V}\) maps propositional letters to sets of worlds, as  usual. There is a special condition imposed: for each \(i\) = 1,  …,\(n , \mathcal{R}_{i} \subseteq \mathcal{R}\).