On the satisfiability problem for fragments of the two-variable logic with one transitive relation

    Journal of Logic and Computation, pp. 881-911, 2019.

    Cited by: 1|Bibtex|Views0|Links
    EI

    Abstract:

    study the satisfiability problem for the two-variable first-order logic over structures with one transitive relation. % show that the problem is decidable in 2-NExpTime for the fragment consisting of formulas where existential quantifiers are guarded by transitive atoms. As this fragment enjoys neither the finite model nor the tree mode...More

    Code:

    Data:

    Your rating :
    0

     

    Tags
    Comments