Skip Navigation



Journal of Logic and Computation Advance Access published online on September 26, 2006
Journal of Logic and Computation, doi:10.1093/logcom/exl034
This Article
Right arrow Full Text (Rapid PDF)
Right arrow All Versions of this Article:
17/1/133    most recent
exl034v1
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Pratt-Hartmann, I.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© The Author, 2006. Published by Oxford University Press. All rights reserved. For Permissions, please email: journals.permissions@oxfordjournals.org
Received February 3, 2006

Original Papers

Complexity of the Guarded Two-variable Fragment with Counting Quantifiers

Ian Pratt-Hartmann 1 *

1 School of Computer Science, University of Manchester, Manchester M13 9PL, UK

* To whom correspondence should be addressed.
Ian Pratt-Hartmann, E-mail: ipratt{at}cs.man.ac.uk


  Abstract

The finite satisfiability problem for the guarded two-variable fragment with counting quantifiers is in EXPTIME.

Keywords: Two-variable fragment; guarded fragment; counting quantifiers; logic; complexity.
Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer: Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.