A Non-Wellfounded and Labelled Sequent Calculus for Bimodal Provability Logic
By: Justus Becker
Potential Business Impact:
Makes computer logic understand complex rules better.
We present a labelled and non-wellfounded calculus for the bimodal provability logic CS. The system is obtained by modelling the Kripke-like semantics of this logic. As in arXiv:2309.00532, we enforce the second-order property of converse wellfoundedness by using techniques from cyclic proof theory. We will prove soundness and completeness of this system with respect to the semantics and provide a primitive decision procedure together with a way to extract countermodels.
Similar Papers
Interpolation for the two-way modal mu-calculus
Logic in Computer Science
Helps computers understand complex logic rules.
A Bi-nested Calculus for Intuitionistic K: Proofs and Countermodels
Logic in Computer Science
Helps computers prove math ideas faster.
Propositional Measure Logic
Logic in Computer Science
Lets computers think with uncertain facts.