Intuitionistic Justification Logic, Semantically

Sonia Marin
(University of Birmingham)
Paaras Padhiar
(University of Birmingham)
Ian Shillito
(University of Birmingham)

Justification logics are explicit versions of modal logic. In the classical setting, this means boxes are refined with explicit proof terms and interact with each other through proof operations. This exercise was extended to intuitionistic modal logic with native diamonds. In this setting, diamonds are refined to satisfier terms and come equipped with additional operations.

Justification logic enjoys a connection to its corresponding modal logic through a realisation theorem. In the classical setting, this is achieved through either proof-theoretic or semantic methodology. So far, intuitionistic justification logic with satisfiers has only been presented syntactically with a proof-theoretic realisation theorem.

We present two classes of semantics for intuitionistic justification logic with soundness and completeness results: basic modular models, which extend possible world semantics for intuitionistic propositional logic; modular models which contain Kripke-style machinery to promote "backwards compatibility" to modal logic. Using modular models, we present a realisation theorem to establish a connection between intuitionistic justification logic and its corresponding intuitionistic modal logic.

In Marta Bílková, Malvin Gattinger, Iris van der Giessen, Marianna Girlando and Yanjing Wang: Proceedings of the Sixteenth International Conference on Advances in Modal Logic (AiML 2026), Amsterdam, The Netherlands, 29-06-2026, Electronic Proceedings in Theoretical Computer Science 447, pp. 603–622.
Published: 29th June 2026.

ArXived at: https://dx.doi.org/10.4204/EPTCS.447.34 bibtex PDF
References in reconstructed bibtex, XML and HTML format (approximated).
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org