NP-Logic Systems and Model-Equivalence Reductions

被引:0
|
作者
Yu-Ping Shen
Xi-Shun Zhao
机构
[1] Sun Yat-Sen University,Institute of Logic and Cognition
[2] Sun Yat-Sen University,Department of Philosophy
关键词
logic system; model-equivalent reduction; expressive power; computational complexity;
D O I
暂无
中图分类号
学科分类号
摘要
In this paper we investigate the existence of model-equivalence reduction between NP-logic systems which are logic systems with model existence in NP. It is shown that among all NP-systems with model checking problem in NP, the existentially quantified propositional logic (∃PF) is maximal with respect to poly-time model-equivalent reduction. However, ∃PF seems not a maximal NP-system in general because there exits an NP-system with model checking problem DP -complete.
引用
收藏
页码:1321 / 1326
页数:5
相关论文
共 50 条