Expressive Completeness for LTL With Modulo Counting and Group Quantifiers

Authors:
A. V. Sreejith
Affiliations:
Institute of Mathematical Sciences, CIT Campus, Taramani, Chennai, India
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2011

Citing 13
Cited 0

On uniformity within NC1

Journal of Computer and System Sciences - 3rd Annual Conference on Structure in Complexity Theory, June 14–17, 1988
Temporal logic (vol. 1): mathematical foundations and computational aspects

Temporal logic (vol. 1): mathematical foundations and computational aspects
Regular languages defined with generalized quantifiers

Information and Computation
On Gabbay's temporal fixed point operator

Theoretical Computer Science
On the temporal analysis of fairness

POPL '80 Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
On the Expressive Completeness of the Propositional mu-Calculus with Respect to Monadic Second Order Logic

CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
Temporal Logic with Fixed Points

Temporal Logic in Specification
The Declarative Past and Imperative Future: Executable Temporal Logic for Interactive Systems

Temporal Logic in Specification
First-order logic with two variables and unary temporal logic

Information and Computation - Special issue: LICS'97
Modular Temporal Logic

LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Word problems requiring exponential time(Preliminary Report)

STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
The temporal logic of programs

SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
LTL can be more succinct

ATVA'10 Proceedings of the 8th international conference on Automated technology for verification and analysis

Quantified Score

Hi-index	0.00

Visualization

Abstract

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, Therien) is expressively complete for first order logic with modulo counting (introduced by Straubing, Therien, Thomas) and group quantifiers (introduced by Barrington, Immerman, Straubing).