On the computational complexity of decidable fragments of first-order linear temporal logics
| Image |  |
|---|---|
| Description | |
| Author/s |
author: Roman Kontchakov |
| Publication date | |
| Language | |
| Country of origin | |
| Wikipedia link | |
| Copyright status | |
| Missing/wrong data? | Edit Wikidata item |