The Finite Satisfiability Problem for Two-Variable, First-Order Logic with one Transitive Relation is Decidable
Fuente:
arXiv
Salvato in:
| Autore principale: | |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2017
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866911849996353536 |
|---|---|
| author | Pratt-Hartmann, Ian |
| author_facet | Pratt-Hartmann, Ian |
| contents | 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 problem for this logic is shown to be decidable, in triply exponential non-deterministic time. The complexity falls to doubly exponential non-deterministic time if the distinguished binary predicate is constrained to be interpreted as a partial order. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_1707_05558 |
| institution | arXiv |
| publishDate | 2017 |
| record_format | arxiv |
| spellingShingle | The Finite Satisfiability Problem for Two-Variable, First-Order Logic with one Transitive Relation is Decidable Pratt-Hartmann, Ian Logic in Computer Science 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 problem for this logic is shown to be decidable, in triply exponential non-deterministic time. The complexity falls to doubly exponential non-deterministic time if the distinguished binary predicate is constrained to be interpreted as a partial order. |
| title | The Finite Satisfiability Problem for Two-Variable, First-Order Logic with one Transitive Relation is Decidable |
| topic | Logic in Computer Science |
| url | https://arxiv.org/abs/1707.05558 |