Pages that link to "Item:Q3644771"
From MaRDI portal
The following pages link to On the Complexity of Branching-Time Logics (Q3644771):
Displaying 12 items.
- Completeness of a branching-time logic with possible choices (Q622622) (← links)
- A new face of the branching recurrence of computability logic (Q712555) (← links)
- Sublogics of a branching time logic of robustness (Q1740655) (← links)
- On the expressive power of hybrid branching-time logics (Q1989342) (← links)
- Linear time Datalog and branching time logic (Q2734948) (← links)
- (Q3757893) (← links)
- (Q4475142) (← links)
- (Q4508400) (← links)
- On Computability of Logical Approaches to Branching-Time Property Verification of Programs (Q5145688) (← links)
- (Q5202985) (← links)
- Finite and Circular Path Models for Branching Time Logics (Q5753939) (← links)
- Correct Hardware Design and Verification Methods (Q5897075) (← links)