Papers
Topics
Authors
Recent
Search
2000 character limit reached

Intuitionistic Justification Logic, Semantically

Published 30 Jun 2026 in cs.LO | (2606.31884v1)

Abstract: 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.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.

Tweets

Sign up for free to view the 1 tweet with 0 likes about this paper.