Complexity of the Two-Variable Fragment with Counting Quantifiers
- 1 June 2005
- journal article
- research article
- Published by Springer Nature in Journal of Logic, Language and Information
- Vol. 14 (3) , 369-395
Abstract
No abstract availableKeywords
All Related Versions
This publication has 5 references indexed in Scilit:
- Complexity of two-variable logic with counting2002
- Two-variable logic with counting is decidable2002
- Complexity Results for First-Order Two-Variable Logic with CountingSIAM Journal on Computing, 2000
- On logics with two variablesTheoretical Computer Science, 1999
- On the complexity of integer programmingJournal of the ACM, 1981