Expressive Completeness for LTL With Modulo Counting and Group Quantifiers
نویسنده
چکیده
Kamp showed that linear temporal logic is expressively complete for first order logic over words. We give a Gabbay style proof to show that linear temporal logic extended with modulo counting and group quantifiers (introduced by Baziramwabo,McKenzie,Thérien) is expressively complete for first order logic with modulo counting (introduced by Straubing, Thérien, Thomas) and group quantifiers (introduced by Barrington, Immerman, Straubing).
منابع مشابه
LTL Can Be More Succinct
It is well known that modelchecking and satisfiability of Linear Temporal Logic (LTL) are Pspace-complete. Wolper showed that with grammar operators, this result can be extended to increase the expressiveness of the logic to all regular languages. Other ways of extending the expressiveness of LTL using modular and group modalities have been explored by Baziramwabo, McKenzie and Thérien, which a...
متن کاملOn the Expressive Power of QLTL
LTL cannot express the whole class of ω-regular languages and several extensions have been proposed. Among them, Quantified propositional Linear Temporal Logic (QLTL), proposed by Sistla, extends LTL by quantifications over the atomic propositions. The expressive power of LTL and its fragments have been made relatively clear by numerous researchers. However, there are few results on the express...
متن کاملOn Presburger Arithmetic Extended with Modulo Counting Quantifiers
We consider Presburger arithmetic (PA) extended with modulo counting quantifiers. We show that its complexity is essentially the same as that of PA, i.e., we give a doubly exponential space bound. This is done by giving and analysing a quantifier elimination procedure similar to Reddy and Loveland’s procedure for PA. We also show that the complexity of the automata-based decision procedure for ...
متن کاملExpressivity and Succinctness of Order-Invariant Logics on Depth-Bounded Structures
We study the expressive power and succinctness of orderinvariant sentences of first-order (FO) and monadic second-order (MSO) logic on graphs of bounded tree-depth. Order-invariance is undecidable in general and, therefore, in finite model theory, one strives for logics with a decidable syntax that have the same expressive power as orderinvariant sentences. We show that on graphs of bounded tre...
متن کاملExtending Two-Variable Logic on Trees
The finite satisfiability problem for the two-variable fragment of first-order logic interpreted over trees was recently shown to be ExpSpace-complete. We consider two extensions of this logic. We show that adding either additional binary symbols or counting quantifiers to the logic does not affect the complexity of the finite satisfiability problem. However, combining the two extensions and ad...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. Notes Theor. Comput. Sci.
دوره 278 شماره
صفحات -
تاریخ انتشار 2011