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


An AC 1-complete model checking problem for intuitionistic logic
Authors:Martin Mundhenk  Felix Wei
Affiliation:1. Institut für Informatik, Universit?t Jena, 07737, Jena, Germany
Abstract:We show that the model checking problem for intuitionistic propositional logic with one variable is complete for logspace-uniform AC 1. For superintuitionistic logics with one variable, we obtain NC 1-completeness for the model checking problem.
Keywords:
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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