Complexity of the two-variable fragment with counting quantifiers

Journal of Logic, Language and Information

Volumn 14, Issue 3, 2005, Pages 369-395

  Pratt Hartmann, Ian ^a  

^a UNIVERSITY OF MANCHESTER   (United Kingdom)

Author keywords

Complexity; Counting quantifiers; Logic; Two variable fragment

Indexed keywords

EID: 23844511289     PISSN: 09258531     EISSN: 15729583     Source Type: Journal    
DOI: 10.1007/s10849-005-5791-1     Document Type: Conference Paper

References (5)

1. Grädel, E. and Otto, M., 1999, "On logics with two variables," Theoretical Computer Science 224(1/2), 73-113.
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.
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.
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.
5. Papadimitriou, C.H., 1981, "On the complexity of integer programming," Journal of the Association for Computing Machinery 28(4), 765-768.