Complexity of admissible rules
- First Online:
- Cite this article as:
- Jeřábek, E. Arch. Math. Logic (2007) 46: 73. doi:10.1007/s00153-006-0028-9
- 51 Downloads
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.