NP-Logic Systems and Model-Equivalence Reductions

Yuping Shen
(Institute of Logic and Cognition, Sun Yat-sen University)
Xishun Zhao
(Institute of Logic and Cognition, Sun Yat-sen University)

In this paper we investigate the existence of model-equivalence reduction between NP-logic systems which are logic systems with model existence problem 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 a NP-system with model checking problem D^P-complete.

In Xizhong Zheng and Ning Zhong: Proceedings Seventh International Conference on Computability and Complexity in Analysis (CCA 2010), Zhenjiang, China, 21-25th June 2010, Electronic Proceedings in Theoretical Computer Science 24, pp. 130–138.
Published: 3rd June 2010.

ArXived at: http://dx.doi.org/10.4204/EPTCS.24.17 bibtex PDF

Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org