Finite Satisfiability of the Two-Variable Guarded Fragment with Transitive Guards and Related Variants

    ACM Trans. Comput. Log., Volume abs/1611.03267, Issue 2, 2018.

    Cited by: 6|Bibtex|Views0|Links
    EI
    Keywords:
    Two-variable logic computational complexity equivalence relation finite satisfiability problem guarded fragmentMore(1+)

    Abstract:

    We consider extensions of the two-variable guarded fragment, GF2, where distinguished binary predicates that occur only in guards are required to be interpreted in a special way (as transitive relations, equivalence relations, preorders, or partial orders). We prove that the only fragment that retains the finite (exponential) model proper...More

    Code:

    Data:

    Your rating :
    0

     

    Tags
    Comments