On semantics of first-order justification logic with binding modalities
By: Tatiana Yavorskaya, Elena Popova
Potential Business Impact:
Lets computers understand math with missing pieces.
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.
Similar Papers
Proof-theoretic Semantics for Second-order Logic
Logic
Makes logic rules work without needing big math.
First-Order Modal Logic via Logical Categories
Logic in Computer Science
Makes computers understand logic better.
Intuitionistic modal logics: epistemic reasoning with distributed knowledge
Logic in Computer Science
Adds "knowing" to logic puzzles about beliefs.