The Sequence Equivalence Problem is Decidable for 0S Systems

The common metric temporal logic for continuous time were shown to be insufficient, when it was proved that they cannot express a modality suggested by Pnueli. Moreover no finite temporal logic can express all the natural generalizations of this ...

In this talk, I survey recent work on extensions of various well-known decidable fragments of first-order logic, in which certain distinguished predicates are required to denote transitive relations or equivalence relations. I explain the origins ...