Abstract
We extend first-order logic with successor using the least fixed point operator and the Hamiltonian path generalized quantifier simultaneously, and show that the complexity class captured is PNP: we also obtain a normal form for this logic. We consider the incorporation of the least fixed point operator into other logics capturing NP and see that this may present difficulties in general. We apply our results to obtain, amongst other results, a new complete problem for PNP involving the evaluation of logically defined functions.
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
