NP-Logic Systems and Model-Equivalence Reductions

Details NP-Logic Systems and Model-Equivalence Reductions NP-Logic Systems and Model-Equivalence Reductions

2010-06-02

arxiv.org/abs/1006.0403v1

EPTCS 24, 2010, pp. 130-138

Computer Science

Logic in Computer Science

Scientific paper

10.4204/EPTCS.24.17

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 (\exists PF) is maximal with respect to poly-time model-equivalent reduction. However, \exists PF seems not a maximal NP-system in general because there exits a NP-system with model checking problem D^P-complete.

Affiliated with

Also associated with

No associations

Rating

NP-Logic Systems and Model-Equivalence Reductions does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with NP-Logic Systems and Model-Equivalence Reductions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and NP-Logic Systems and Model-Equivalence Reductions will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-512953