NP reasoning in the monotone \(\mu\)-calculus
From MaRDI portal
Publication:2096471
DOI10.1007/978-3-030-51074-9_28OpenAlexW3039203491MaRDI QIDQ2096471
Daniel Hausmann, Lutz Schröder
Publication date: 9 November 2022
Full work available at URL: https://arxiv.org/abs/2002.05075
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Games for the \(\mu\)-calculus
- Alternating finite automata on \(\omega\)-words
- Propositional dynamic logic of regular programs
- Game logic -- an overview
- A propositional dynamic logic for instantial neighborhood semantics
- EXPTIME Tableaux for the Coalgebraic mu-Calculus
- Concurrent dynamic logic
- Using the Universal Modality: Gains and Questions
- The Computational Complexity of Provability in Systems of Modal Propositional Logic
- Normal monomodal logics can simulate all others
- Infinite Games
- Deciding the unguarded modal -calculus
- Global Caching for the Alternation-free µ-Calculus
- Monadic Second-Order Logic and Bisimulation Invariance for Coalgebras
- On guarded transformation in the modal -calculus
- Conceptual Structures for Knowledge Creation and Communication
This page was built for publication: NP reasoning in the monotone \(\mu\)-calculus
