Temporal Logics over Transitive States - Semantic Scholar

1 downloads 0 Views 647KB Size Report
next-time operator Ä) that are capable of reasoning about states with transitive relations. Such logics are known to be undecidable (even Π1. 1 - complete) if the ...
Temporal Logics over Transitive States Boris Konev1 , Frank Wolter1 , and Michael Zakharyaschev2 1

Department of Computer Science, University of Liverpool, Liverpool L69 7ZF, U.K. {b.konev, frank}@csc.liv.ac.uk 2 Department of Computer Science, King’s College London, Strand, London WC2R 2LS, U.K. [email protected]

Abstract. We investigate the computational behaviour of ‘two-dimensional’ propositional temporal logics over (N,