DeepAI AI Chat
Log In Sign Up

Complexity and Expressivity of Branching- and Alternating-Time Temporal Logics with Finitely Many Variables

by   Mikhail Rybakov, et al.

We show that Branching-time temporal logics CTL and CTL*, as well as Alternating-time temporal logics ATL and ATL*, are as semantically expressive in the language with a single propositional variable as they are in the full language, i.e., with an unlimited supply of propositional variables. It follows that satisfiability for CTL, as well as for ATL, with a single variable is EXPTIME-complete, while satisfiability for CTL*, as well as for ATL*, with a single variable is 2EXPTIME-complete,--i.e., for these logics, the satisfiability for formulas with only one variable is as hard as satisfiability for arbitrary formulas.


page 1

page 2

page 3

page 4


Complexity and expressivity of propositional dynamic logics with finitely many variables

We investigate the complexity of satisfiability for finite-variable frag...

Two-variable logics with some betweenness relations: Expressiveness, satisfiability and membership

We study two extensions of FO2[<], first-order logic interpreted in fini...

Why Propositional Quantification Makes Modal and Temporal Logics on Trees Robustly Hard?

Adding propositional quantification to the modal logics K, T or S4 is kn...

Elementary Multimodal Logics

We study multimodal logics over universally first-order definable classe...

Combining Spatial and Temporal Logics: Expressiveness vs. Complexity

In this paper, we construct and investigate a hierarchy of spatio-tempor...

Reducing NEXP-complete problems to DQBF

We present an alternative proof of the NEXP-hardness of the satisfiabili...

Two variable logic with ultimately periodic counting

We consider the extension of two variable logic with quantifiers that st...