Complexity of Admissible Rules in the Implication-Negation Fragment of Intuitionistic Logic
The goal of this paper is to study the complexity of the set of admissible rules of the implication-negation fragment of intuitionistic logic IPC. Surprisingly perhaps, although this set strictly contains the set of derivable rules (the fragment is not structurally complete), it is also PSPACE-complete. This differs from the situation in the full logic IPC where the admissible rules form a co-NEXP-complete set.
2000 ◽
Vol 46
(2)
◽
pp. 207-218
◽
1987 ◽
Vol 56
(2)
◽
pp. 311-331
◽
1993 ◽
Vol 3
(2)
◽
pp. 129-136
◽
2010 ◽
Vol 162
(2)
◽
pp. 162-171
◽
1998 ◽
Vol 52
(3)
◽
pp. 32-36
2018 ◽