Pages that link to "Item:Q1168965"
From MaRDI portal
The following pages link to Process logic: Expressiveness, decidability, completeness (Q1168965):
Displayed 17 items.
- Branching versus linear logics yet again (Q911747) (← links)
- A simple deduction method for modal logic (Q1051628) (← links)
- Process logic with regular formulas (Q1062047) (← links)
- The complementation problem for Büchi automata with applications to temporal logic (Q1088653) (← links)
- \(R\)-generability, and definability in branching time logics (Q1197983) (← links)
- Process and action: Relevant theory and logics (Q1207427) (← links)
- Dynamic linear time temporal logic (Q1295431) (← links)
- Computation paths logic: An expressive, yet elementary, process logic (Q1295436) (← links)
- An overview of transaction logic (Q1341707) (← links)
- Mathematical modal logic: A view of its evolution (Q1422628) (← links)
- Completeness of Kozen's axiomatisation of the propositional \(\mu\)-calculus. (Q1854336) (← links)
- Alternative semantics for temporal logics (Q2265815) (← links)
- Compositionality of Hennessy-Milner logic by structural operational semantics (Q2368979) (← links)
- A decision procedure for propositional projection temporal logic with infinite models (Q2480780) (← links)
- From Philosophical to Industrial Logics (Q3601803) (← links)
- Complexity of propositional projection temporal logic with star (Q3616217) (← links)
- From Monadic Logic to PSL (Q5452203) (← links)