首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Admissible rules in the implication-negation fragment of intuitionistic logic
Authors:Petr Cintula  George Metcalfe
Institution:
  • a Institute of Computer Science, Academy of Sciences of the Czech Republic, Pod Vodarenskou vezi 2, 182 07 Prague 8, Czech Republic
  • b Mathematics Institute, University of Bern, Sidlerstrasse 5, 3012 Bern, Switzerland
  • Abstract:Uniform infinite bases are defined for the single-conclusion and multiple-conclusion admissible rules of the implication-negation fragments of intuitionistic logic View the MathML source and its consistent axiomatic extensions (intermediate logics). A Kripke semantics characterization is given for the (hereditarily) structurally complete implication-negation fragments of intermediate logics, and it is shown that the admissible rules of this fragment of View the MathML source form a PSPACE-complete set and have no finite basis.
    Keywords:03B20  03B22  03B55
    本文献已被 ScienceDirect 等数据库收录!
    设为首页 | 免责声明 | 关于勤云 | 加入收藏

    Copyright©北京勤云科技发展有限公司  京ICP备09084417号