Henkin quantifiers and complete problems

https://doi.org/10.1016/0168-0072(86)90040-0Get rights and content
Under an Elsevier user license
open archive

Abstract

We analyze computational aspects of partially ordered quantification in first-order logic. Show that almost any non-linear quantifier, applied to quantifier-free first-order formula suffices to express an NP-complete predicate. The remaining non-linear quantifiers experiment exactly co-NL predicates.

Cited by (0)

Partially supported by NSF grant MCS 81-01560.

Partially supported by NSF grant MCS 83-01022.