Sciweavers

Share
AML
2007

Complexity of admissible rules

11 years 5 months ago
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.
Emil Jerábek
Added 08 Dec 2010
Updated 08 Dec 2010
Type Journal
Year 2007
Where AML
Authors Emil Jerábek
Comments (0)
books