Skip to main content

On the complexity of temporal logics over linear time domains

Alexander Rabinovich ( Tel Aviv University )

We investigate the complexity of the validity  problem of temporal logics with a finite set of modalities.

We show that the problem is in PSPACE over the rationals, over the reals, over the class of all linear orders  and over many interesting classes  of linear orders.

Share this: