Name
Abstract | ||
|---|---|---|
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 show that this extension has the finite model property. More specifically, we show that every satisfiable formula has a model of at most doubly exponential size. We argue that the satisfiability (= finite satisfiability) problem for this logic is 2-ExpTime-complete. We also transfer our results to a restricted variant of the guarded negation fragment with equivalence relations. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1145/3209108.3209205 | LICS'18: PROCEEDINGS OF THE 33RD ANNUAL ACM/IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE |
Keywords | DocType | Volume |
unary negation fragment,equivalence relations,satisfiability,finite satisfiability,finite model property | Conference | abs/1802.01318 |
Citations | PageRank | References |
0 | 0.34 | 13 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Daniel Danielski | 1 | 0 | 0.34 |
| Emanuel Kieronski | 2 | 114 | 13.85 |