Primal Infon Logic: Derivability in Polynomial Time
Primal infon logic (PIL), introduced by Gurevich and Neeman in 2009, is a logic for authorization in distributed systems. It is a variant of the (and, implies)-fragment of intuitionistic modal logic. It presents many interesting technical challenges -- one of them is to determine the complexity of the derivability problem. Previously, some restrictions of propositional PIL were proved to have a linear time algorithm, and some extensions have been proved to be PSPACE-complete. In this paper, we provide an O(N^3) algorithm for derivability in propositional PIL. The solution involves an interesting interplay between the sequent calculus formulation (to prove the subformula property) and the natural deduction formulation of the logic (based on which we provide an algorithm for the derivability problem).
Authorization logics
Intuitionistic modal logic
Proof theory
Cut elimination
Subformula property
163-174
Regular Paper
Anguraj
Baskar
Anguraj Baskar
Prasad
Naldurg
Prasad Naldurg
K. R.
Raghavendra
K. R. Raghavendra
S. P.
Suresh
S. P. Suresh
10.4230/LIPIcs.FSTTCS.2013.163
Creative Commons Attribution 3.0 Unported license
https://creativecommons.org/licenses/by/3.0/legalcode