Explicitness plays an important role in many parts of mathematics and computer science. Constructive and intuitionistic proofs, for example, provide explicit witnesses for existential assertions. In the area of explicit mathematics, operations and types are explicitly given by terms of the language.

These traditional and well-established areas are complemented by more recent developments. Justification logics, the first of which was conceived 20 years ago in Bern, are natural extensions of modal logics with the capability of unfolding belief and knowledge modalities into explicit justification terms. Even more recent are infon logics, which have been developed in the context of distributed authorization and deal with pieces of information explicitly.

The purpose of this workshop is to provide a platform for presenting new results in these research areas.