NP reasoning in the monotone -calculus

DOI10.1007/978-3-030-51074-9_28MaRDI QIDQ2096471zbMATH OpenOpenAlexFDO

Authors Daniel Hausmann, Lutz Schröder

Publication date 9 November 2022

Full work available at URL https://arxiv.org/abs/2002.05075

Mathematics Subject Classification ID

Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)

Cites work

• scientific article; zbMATH DE number 4181308 (Why is no real title available?)
• scientific article; zbMATH DE number 3880483 (Why is no real title available?)
• scientific article; zbMATH DE number 3670430 (Why is no real title available?)
• A coalgebraic perspective on monotone modal logic
• A propositional dynamic logic for instantial neighborhood semantics
• Alternating finite automata on \(\omega\)-words
• Computing the least common subsumer in the description logic \(\mathcal{EL}\) w.r.t. terminological cycles with descriptive semantics
• Concurrent dynamic logic
• Deciding the unguarded modal \(\mu\)-calculus
• EXPTIME tableaux for the coalgebraic \(\mu\)-calculus
• Game logic -- an overview
• Games for the \(\mu\)-calculus
• Global caching for the alternation-free \(\mu\)-calculus
• Infinite Games
• Modal logics and mu-calculi: An introduction
• Monadic second-order logic and bisimulation invariance for coalgebras
• Normal monomodal logics can simulate all others
• On guarded transformation in the modal \(\mu\)-calculus
• Propositional dynamic logic of regular programs
• The Computational Complexity of Provability in Systems of Modal Propositional Logic
• Using the Universal Modality: Gains and Questions

This page was built for publication: NP reasoning in the monotone \(\mu\)-calculus

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2096471)