Score: 0

On semantics of first-order justification logic with binding modalities

Published: December 8, 2025 | arXiv ID: 2512.07994v1

By: Tatiana Yavorskaya, Elena Popova

Potential Business Impact:

Lets computers understand math with missing pieces.

Business Areas:
Semantic Web Internet Services

We introduce the first order logic of proofs $FOLP^\Box$ in the joint language combining justification terms and binding modalities. The main issue is Kripke--style semantics for this logic. We describe models for $FOLP^\Box$ in terms of valuations of individual variables instead of introducing constants to the language. This approach requires a new format of the evidence function. This allows us to assign semantic meaning to formulas that contain free variables. The main results are soundness and completeness of $FOLP^\Box$ with respect to the described semantics.

Page Count
21 pages

Category
Computer Science:
Logic in Computer Science