A completeness result for implicit justification stit logic
Grigory K. Olkhovikov

TL;DR
This paper establishes a completeness result for a specific fragment of justification stit logic, demonstrating a form of restricted strong completeness and compactness despite the absence of a fully strongly complete axiomatization.
Contribution
It introduces a restricted form of strong completeness and compactness for the implicit fragment of justification stit logic, advancing theoretical understanding.
Findings
A restricted form of strong completeness is achieved.
A version of restricted compactness is deduced.
Full strong completeness is not possible for this fragment.
Abstract
We present a completeness result for the implicit fragment of justification stit logic. Although this fragment allows for no strongly complete axiomatization, we show that a restricted form of strong completeness (subsuming weak completeness) is available, as well as deduce a version of restricted compactness property.
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
TopicsLogic, programming, and type systems · Formal Methods in Verification · Logic, Reasoning, and Knowledge
