University of Oxford Logo University of OxfordDepartment of Computer Science - Home

On the complexity of temporal logics over linear time domains

Alexander Rabinovich (Tel Aviv University)

Info

Date

16th February 2010 (week 5, Hilary Term 2010)

Time

16:30

Place

Lecture Theatre B

Abstract

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.

Further info

Related series