Search results
- 1.0391889 - ÚI 2014 GB eng A - Abstract
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]
R&D Projects: GA MŠMT(CZ) 1M0545
Institutional research plan: CEZ:AV0Z10300504
Keywords : intuitionistic logic * intermediate logics * admissible rules * structural completeness * complexity
Subject RIV: BA - General Mathematics
http://www.easychair.org/publications/?page=719443787
Permanent Link: http://hdl.handle.net/11104/0220861File Download Size Commentary Version Access 0391889.pdf 2 958.2 KB Publisher’s postprint require - 2.0350483 - ÚI 2011 RIV NL eng J - Journal Article
Cintula, Petr - Metcalfe, G.
Admissible Rules in the Implication–Negation Fragment of Intuitionistic Logic.
Annals of Pure and Applied Logic. Roč. 162, č. 2 (2010), s. 162-171. ISSN 0168-0072. E-ISSN 1873-2461
R&D Projects: GA AV ČR IAA900090703
Institutional research plan: CEZ:AV0Z10300504
Keywords : intuitionistic logic * intermediate logics * admissible rules * structural completeness
Subject RIV: BA - General Mathematics
Impact factor: 0.646, year: 2010
Permanent Link: http://hdl.handle.net/11104/0190481File Download Size Commentary Version Access 0350483.pdf 8 683.8 KB Author´s preprint open-access