Complexity of admissible rules

We investigate the computational complexity of deciding whether a given inference rule is admissible for some modal and superintuitionistic logics. We state a broad condition under which the admissibility problem is coNEXP-hard. We also show that admissibility in several well-known systems (including GL, S4, and IPC) is in coNE, thus obtaining a sharp complexity estimate for admissibility in these systems.

• Type: Journal
• Year: 2007
• Where: AML
• Authors: Emil Jerábek
• Keywords: Admissibility Problem, AML 2007, Computational Complexity, Inference Rule