Complexity of Admissible Rules in the Implication-Negation Fragment of Intuitionistic Logic

Bibliographic details

Authors

Petr Cintula, G. Metcalfe

Publication year

2013

Publication type

Abstrakt

Periodical

LPAR-17-short papers for 17th International Conference on Logic for Programming, Artificial intelligence, and Reasoning

Projects

• Institute for Theoretical Computer Science

Bibliographic citation

CINTULA, Petr, METCALFE, G. Complexity of Admissible Rules in the Implication-Negation Fragment of Intuitionistic Logic. In: VORONKOV, A., SUTCLIFFE, G., BAAZ, M., FERMÜLLER, C., eds. LPAR-17-short papers for 17th International Conference on Logic for Programming, Artificial intelligence, and Reasoning. University of Manchester: EasyChair Conference System, 2013, S. 1-5. EPiC, 13. ISSN 2040-557X. Dostupné z: http://www.easychair.org/publications/?page=719443787

ID

391889