Expressive completeness for LTL with modulo counting and group quantifiers

DOI10.1016/J.ENTCS.2011.10.016MaRDI QIDQ2825418zbMATH OpenOpenAlexWikidataFDO

Authors 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 logicgroup quantifierslinear temporal logicmodulo counting

Mathematics Subject Classification ID

Temporal logic (03B44)

Recommendations

• LTL Can Be More Succinct
• Expressive completeness for metric temporal logic
• When is metric temporal logic expressively complete?
• Expressive completeness of temporal logic of trees
• On the expressive power of temporal logic

Cites work

• Dynamic linear time temporal logic
• First-order logic with two variables and unary temporal logic
• scientific article; zbMATH DE number 747023 (Why is no real title available?)
• scientific article; zbMATH DE number 3560737 (Why is no real title available?)
• scientific article; zbMATH DE number 3368555 (Why is no real title available?)
• LTL Can Be More Succinct
• Modality and quantification in S5
• On Gabbay's temporal fixed point operator
• On uniformity within \(NC^ 1\)
• Regular languages defined with generalized quantifiers
• Temporal logic can be more expressive

Cited in

(1)

• Modulo counting on words and trees

This page was built for publication: Expressive completeness for LTL with modulo counting and group quantifiers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2825418)