Game quantification patterns

1Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We analyse two basic approaches of extending classical logics with quantifiers interpreted via games: Propositional Game Logic of Parikh and Alternating-Time Temporal Logic of Alur, Henzinger, and Kupferman. Although the two approaches are historically remote and they incorporate operationally orthogonal paradigms, we trace the formalisms back to common foundations and argue that they share remarkable similarities in terms of expressive power. © 2009 Springer Berlin Heidelberg.

Cite

CITATION STYLE

APA

Berwanger, D., & Pinchinat, S. (2009). Game quantification patterns. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5378 LNAI, pp. 116–130). https://doi.org/10.1007/978-3-540-92701-3_8

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free