activity
20042024
most citedComplexity of the Two-Variable Fragment with (Binary-Coded) Counting Quantifiers

184 citations · 617 across the 22 of their papers we have counts for

collaborators
Showing 2017Show all

1 paper · 1 filter

cs.LO2017★ 27 cited

The Finite Satisfiability Problem for Two-Variable, First-Order Logic with one Transitive Relation is Decidable

Ian Pratt-Hartmann

We consider the two-variable fragment of first-order logic with one distinguished binary predicate constrained to be interpreted as a transitive relation. The finite satisfiability…