Finite satisfiability for two‐variable, first‐order logic with one transitive relation is decidable
We consider two‐variable, first‐order logic in which a single distinguished predicate is required to be interpreted as a transitive relation. We show that the finite satisfiability problem for this logic is decidable in triply exponential non‐deterministic time. Complexity falls to doubly exponentia...
Saved in:
| Published in | Mathematical logic quarterly Vol. 64; no. 3; pp. 218 - 248 |
|---|---|
| Main Author | |
| Format | Journal Article |
| Language | English |
| Published |
Berlin
Wiley Subscription Services, Inc
01.07.2018
|
| Subjects | |
| Online Access | Get full text |
Cover
Loading…
| Summary: | We consider two‐variable, first‐order logic in which a single distinguished predicate is required to be interpreted as a transitive relation. We show that the finite satisfiability problem for this logic is decidable in triply exponential non‐deterministic time. Complexity falls to doubly exponential non‐deterministic time if the transitive relation is constrained to be a partial order. |
|---|---|
| ISSN: | 0942-5616 1521-3870 |
| DOI: | 10.1002/malq.201700055 |