On the expressive power of temporal logic for infinite words

DOI10.1016/0304-3975(91)90281-6zbMath0728.68073OpenAlexW2036410693MaRDI QIDQ805240

Joëlle Cohen-Chesnot

Publication date: 1991

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

Full work available at URL: https://doi.org/10.1016/0304-3975(91)90281-6

zbMATH Keywords

infinite wordsstar-free languagespropositional temporal logic

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Other nonclassical logic (03B60)

Related Items (4)

On the translation of automata to linear temporal logic ⋮ From LP formulas of the form \(F(t)\) to \(-\omega \)-regular expressions ⋮ Logic, semigroups and automata on words ⋮ Logic over words on denumerable ordinals

Cites Work

• First-order logic and star-free sets
• Classifying regular events in symbolic logic
• On the expressive power of temporal logic
• Dot-depth of star-free events
• Temporal logic can be more expressive
• Application of model theoretic games to discrete linear orders and finite automata
• Star-free regular sets of ω-sequences
• On finite monoids having only trivial subgroups
• A Note on Star-Free Events
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the expressive power of temporal logic for infinite words