About the temporal logic of the lexicographic products of unbounded dense linear orders: a new study of its computability
Résumé
This article considers the temporal logic of the lexicographic products of unbounded dense linear orders and provides via mosaics a new proof of the membership in NP of the satisfiability problem it gives rise to.
| Origine | Fichiers produits par l'(les) auteur(s) |
|---|
Loading...