Abstract

Abstract We consider the two-variable fragment of first-order logic with counting quantifiers. We show that this logic lacks the finite model property, but that its satisfiability and finite satisfiability problems are both nevertheless in NExpTime. Our proof employs the results on integer linear programming obtained in the previous chapter. We also establish parametrized complexity bounds concerning the satisfiability problem for the two-variable fragment with counting quantifiers.

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

Disclaimer: 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.