{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,3]],"date-time":"2024-09-03T22:45:48Z","timestamp":1725403548610},"reference-count":0,"publisher":"EasyChair","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"abstract":"<jats:p>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.<\/jats:p>","DOI":"10.29007\/cll3","type":"proceedings-article","created":{"date-parts":[[2018,1,23]],"date-time":"2018-01-23T22:57:35Z","timestamp":1516748255000},"page":"30-24","source":"Crossref","is-referenced-by-count":0,"title":["Complexity of Admissible Rules in the Implication-Negation Fragment of Intuitionistic Logic"],"prefix":"10.29007","volume":"13","author":[{"given":"Petr","family":"Cintula","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"George","family":"Metcalfe","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"11545","event":{"name":"LPAR-17-short. short papers for 17th International Conference on Logic for Programming, Artificial intelligence, and Reasoning."},"container-title":["EPiC Series in Computing"],"original-title":[],"deposited":{"date-parts":[[2018,1,23]],"date-time":"2018-01-23T22:58:39Z","timestamp":1516748319000},"score":1,"resource":{"primary":{"URL":"https:\/\/easychair.org\/publications\/paper\/HJc"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":0,"URL":"https:\/\/doi.org\/10.29007\/cll3","relation":{},"ISSN":["2398-7340"],"issn-type":[{"type":"print","value":"2398-7340"}],"subject":[]}}