Complexity of the guarded two-variable fragment with counting quantifiers

    Research output: Contribution to journalArticlepeer-review

    Abstract

    The finite satisfiability problem for the guarded two-variable fragment with counting quantifiers is in EXPTIME. © The Author, 2006.
    Original languageEnglish
    Pages (from-to)133-155
    Number of pages22
    JournalJournal of Logic and Computation
    Volume17
    Issue number1
    DOIs
    Publication statusPublished - Feb 2007

    Keywords

    • Complexity
    • Counting quantifiers
    • Guarded fragment
    • Logic
    • Two-variable fragment

    Fingerprint

    Dive into the research topics of 'Complexity of the guarded two-variable fragment with counting quantifiers'. Together they form a unique fingerprint.

    Cite this