An infinite hierarchy of temporal logics over branching time

DOI10.1006/inco.2001.2970zbMath1005.03022OpenAlexW1965230791MaRDI QIDQ1854487

Alexander Rabinovich, Shahar Maoz

Publication date: 14 January 2003

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/332aabcea322e5ce078647b1d4583d170da21350

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Temporal logic (03B44) Second- and higher-order model theory (03C85)

Related Items

Arity hierarchy for temporal logics ⋮ \(\text{BTL}_{2}\) and the expressive power of \(\text{ECTL}^{+}\) ⋮ An infinite hierarchy of temporal logics over branching time

Cites Work

• The temporal logic of branching time
• Modalities for model checking: Branching time logic strikes back
• An until hierarchy and other applications of an Ehrenfeucht-Fraïssé game for temporal logic
• An infinite hierarchy of temporal logics over branching time
• An application of games to the completeness problem for formalized theories
• The decision problem for branching time logic
• Automatic verification of finite-state concurrent systems using temporal logic specifications
• “Sometimes” and “not never” revisited
• Buy one, get one free!!!
• Decidability of Second-Order Theories and Automata on Infinite Trees
• On the expressive completeness of the propositional mu-calculus with respect to monadic second order logic
• 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