Journal of Logic, Language and Information

, Volume 14, Issue 3, pp 369–395

Complexity of the Two-Variable Fragment with Counting Quantifiers

Article

Abstract

The satisfiability and finite satisfiability problems for the two-variable fragment of first-order logic with counting quantifiers are both in NEXPTIME, even when counting quantifiers are coded succinctly.

Abstract

two-variable fragment counting quantifiers logic complexity 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Grädel, E. and Otto, M., 1999, “On logics with two variables,” Theoretical Computer Science 224(1/2), 73–113.CrossRefGoogle Scholar
  2. Grädel, E., Otto, M., and Rosen, E., 1997, “Two-variable logic with counting is decidable,” in Proceedings of the 12th IEEE Symposium on Logic in Computer Science, pp. 306–317. IEEE Online Publications.Google Scholar
  3. Pacholski, L., Szwast, W., and Tendera, L., 1997, “Complexity of two-variable logic with counting,” in Proceedings of the 12th IEEE Symposium on Logic in Computer Science, pp. 318–327. IEEE Online Publications.Google Scholar
  4. Pacholski, L., Szwast, W., and Tendera, L., 1999, “Complexity results for first-order two-variable logic with counting,” SIAM Journal on Computing 29(4), 1083–1117.CrossRefGoogle Scholar
  5. Papadimitriou, C.H., 1981, “On the complexity of integer programming,” Journal of the Association for Computing Machinery 28(4), 765–768.Google Scholar

Copyright information

© Springer Science + Business Media, Inc. 2005

Authors and Affiliations

  1. 1.School of Computer ScienceUniversity of ManchesterManchesterUK

Personalised recommendations