Explicit justification stit logic: a completeness result
Grigory K. Olkhovikov

TL;DR
This paper introduces a Hilbert-style axiomatic system for the explicit fragment of justification stit logic and proves its strong completeness relative to the intended semantics.
Contribution
It provides the first complete axiomatic system for the explicit justification stit logic fragment, advancing formal understanding of this logic.
Findings
The axiomatic system is strongly complete.
The logic's semantics are well-founded.
Formal proof of completeness established.
Abstract
We consider the explicit fragment of the basic justification stit logic introduced in earlier publications. We define a Hilbert-style axiomatic system for this logic and show that this system is strongly complete relative to the intended semantics.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Algebra and Logic · Logic, Reasoning, and Knowledge · Logic, programming, and type systems
