5 citations · 12 across the 8 of their papers we have counts for
Showing 2018Show all
2 papers · 1 filter
cs.LO2018
Finite Satisfiability of Unary Negation Fragment with Transitivity
Daniel Danielski, Emanuel Kieronski
We show that the finite satisfiability problem for the unary negation fragment with arbitrary number of transitive relations is decidable and 2-ExpTime-complete. Our result actuall…
cs.LO2018
Unary negation fragment with equivalence relations has the finite model property
Daniel Danielski, Emanuel Kieronski
We consider an extension of the unary negation fragment of first-order logic in which arbitrarily many binary symbols may be required to be interpreted as equivalence relations. We…