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

0391889 - ÚI 2014 GB eng A - Abstrakt
Cintula, Petr - Metcalfe, G.
Complexity of Admissible Rules in the Implication-Negation Fragment of Intuitionistic Logic.
LPAR-17-short papers for 17th International Conference on Logic for Programming, Artificial intelligence, and Reasoning. University of Manchester: EasyChair Conference System, 2013 - (Voronkov, A.; Sutcliffe, G.; Baaz, M.; Fermüller, C.). s. 1-5. ISSN 2040-557X.
[LPAR 2010. International Conference on Logic for Programming, Artificial intelligence, and Reasoning /17./. 10.10.2010-15.10.2010, Yogyakarta]
Grant CEP: GA MŠMT(CZ) 1M0545
Výzkumný záměr: CEZ:AV0Z10300504
Klíčová slova: intuitionistic logic * intermediate logics * admissible rules * structural completeness * complexity
Kód oboru RIV: BA - Obecná matematika
http://www.easychair.org/publications/?page=719443787
Trvalý link: http://hdl.handle.net/11104/0220861