Expressive Completeness for LTL With Modulo Counting and Group Quantifiers

DOI10.1016/j.entcs.2011.10.016zbMath1347.03036OpenAlexW2077300025WikidataQ113318189 ScholiaQ113318189MaRDI QIDQ2825418

A. V. Sreejith

Publication date: 7 October 2016

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.entcs.2011.10.016

zbMATH Keywords

first-order logiclinear temporal logicgroup quantifiersmodulo counting

Mathematics Subject Classification ID

Temporal logic (03B44)

Related Items (1)

Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On Gabbay's temporal fixed point operator
• Dynamic linear time temporal logic
• Regular languages defined with generalized quantifiers
• First-order logic with two variables and unary temporal logic
• On uniformity within \(NC^ 1\)
• Modality and quantification in S5
• Temporal logic can be more expressive
• LTL Can Be More Succinct

This page was built for publication: Expressive Completeness for LTL With Modulo Counting and Group Quantifiers