scientific article; zbMATH DE number 7437713
From MaRDI portal
Publication:5014446
zbMath1476.68176arXiv1509.03018MaRDI QIDQ5014446
Publication date: 2 December 2021
Full work available at URL: https://arxiv.org/abs/1509.03018
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Modal logic (including the logic of norms) (03B45) Logic in computer science (03B70) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The \(\mu\)-calculus alternation hierarchy collapses over structures with restricted connectivity
- Model-checking process equivalences
- On the \(\mu \)-calculus over transitive and finite transitive frames
- Monadic second-order logic on tree-like structures
- Bisimulation-invariant PTIME and higher-dimensional \(\mu\)-calculus
- Arity hierarchies
- A lattice-theoretical fixpoint theorem and its applications
- The modalμ-calculus hierarchy over restricted classes of transition systems
- Relational queries computable in polynomial time
- Theμ-calculus alternation-depth hierarchy is strict on binary trees
- Fixpoint alternation: arithmetic, transition systems, and the binary tree
- Proceedings 8th Workshop on Fixed Points in Computer Science
- The modal mu-calculus alternation hierarchy is strict
This page was built for publication: