| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 421803 | Electronic Notes in Theoretical Computer Science | 2011 | 14 Pages |
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, 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).
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
