An infinite hierarchy of temporal logics over branching time
type: Item
instance of: scholarly article
title: An infinite hierarchy of temporal logics over branching time
zbMATH Open document ID: 1005.03022
author: Alexander Rabinovich
author: Shahar Maoz
published in: Information and Computation
publication date: 2003-01-14T00:00:00Z
Mathematics Subject Classification ID: 03B44
Mathematics Subject Classification ID: 68Q60
Mathematics Subject Classification ID: 03C85
zbMATH DE Number: 1853225
MaRDI profile type: Publication
OpenAlex ID: W1965230791
cites work: The temporal logic of branching time
cites work: Q3336675
cites work: Automatic verification of finite-state concurrent systems using temporal logic specifications
cites work: Q4850061
cites work: An application of games to the completeness problem for formalized theories
cites work: Q3906386
cites work: “Sometimes” and “not never” revisited
cites work: Modalities for model checking: Branching time logic strikes back
cites work: An until hierarchy and other applications of an Ehrenfeucht-Fraïssé game for temporal logic
cites work: Q3835817
cites work: The decision problem for branching time logic
cites work: Q5817866
cites work: Q3768883
cites work: Q4945224
cites work: Q4336034
cites work: Q4247261
cites work: On the expressive completeness of the propositional mu-calculus with respect to monadic second order logic
cites work: Buy one, get one free!!!
cites work: Q3992568
cites work: Q3907077
cites work: Decidability of Second-Order Theories and Automata on Infinite Trees
cites work: Q4536399
cites work: Q3949052
cites work: Q3341881
DOI: 10.1006/INCO.2001.2970
description: scientific article; zbMATH DE number 1853225