NP-Logic Systems and Model-Equivalence Reductions

被引:0
|
作者
Shen, Yu-Ping [1 ,2 ]
Zhao, Xi-Shun [1 ]
机构
[1] Sun Yat Sen Univ, Inst Log & Cognit, Guangzhou 510275, Guangdong, Peoples R China
[2] Sun Yat Sen Univ, Dept Philosophy, Guangzhou 510275, Guangdong, Peoples R China
基金
中国国家自然科学基金;
关键词
logic system; model-equivalent reduction; expressive power; computational complexity;
D O I
10.1007/s11390-010-9408-z
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
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 (there exists PF) is maximal with respect to poly-time model-equivalent reduction However, there exists PF seems not a maximal NP-system in general because there exits an NP-system with model checking problem D-P-complete
引用
收藏
页码:1321 / 1326
页数:6
相关论文
共 50 条