  A version of \(\mathsf{LP}\) with two agents was introduced and studied in (Yavorskaya (Sidon)  2008), though it can be generalized to any finite number of agents. In this, each agent has its own set of justification operators,  variables, and constants, rather than having a single set for  everybody, as above. In addition some limited communication between  agents may be permitted, using a new operator that allows one agent  to verify the correctness of the other agent’s justifications.  Versions of both single world and more general possible world justification semantics were created for the two-agent logics. This involves a straightforward extension of the notion of an evidence function, and for possible world justification models, using two accessibility relations. Realization theorems have been proved syntactically, though presumably a semantic proof would also work.