On Gabbay's temporal fixed point operator

DOI10.1016/0304-3975(94)00084-VzbMath0874.68272OpenAlexW2111376785MaRDI QIDQ673958

I. M. Hodkinson

Publication date: 28 February 1997

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

Full work available at URL: https://doi.org/10.1016/0304-3975(94)00084-v

zbMATH Keywords

MetateMPSPACE-complete satisfiability problemUSF

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27)

Related Items (2)

Modeling data-intensive reactive systems with relational transition systems ⋮ Expressive Completeness for LTL With Modulo Counting and Group Quantifiers

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Temporal logic can be more expressive
• Rabin's uniformization problem
• The complexity of propositional linear temporal logics
• Solving Sequential Conditions by Finite-State Strategies
• Testing and generating infinite sequences by a finite automaton

This page was built for publication: On Gabbay's temporal fixed point operator