Admissibility of $\Pi_2$-Inference Rules: interpolation, model completion, and contact algebras
Nick Bezhanishvili, Luca Carai, Silvio Ghilardi, Lucia Landi

TL;DR
This paper develops methods to determine the admissibility of non-standard inference rules using interpolation and model theory, applying these to symmetric implication calculus and contact algebras to find finite axiomatizations and bases.
Contribution
It introduces three strategies for recognizing rule admissibility and applies them to symmetric implication calculus, providing finite axiomatizations and bases for admissible rules.
Findings
Finite axiomatization of the model completion of contact algebras
Finite basis for admissible -rules in -implication calculus
New methods for rule admissibility via interpolation and model completions
Abstract
We devise three strategies for recognizing admissibility of non-standard inference rules via interpolation, uniform interpolation, and model completions. We apply our machinery to the case of symmetric implication calculus , where we also supply a finite axiomatization of the model completion of its algebraic counterpart, via the equivalent theory of contact algebras. Using this result we obtain a finite basis for admissible -rules.
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
TopicsFormal Methods in Verification · Logic, programming, and type systems · Logic, Reasoning, and Knowledge
