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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
