scientific article; zbMATH DE number 7802070

zbMath1530.68124arXiv2209.10377MaRDI QIDQ6191004

Elli Anastasiadi, Luca Aceto, Adrian Francalanza, Anna Ingólfsdóttir, Antonis Achilleos

Publication date: 8 February 2024

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Descriptive complexity and finite models (68Q19)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Deciding the winner in parity games is in \(\mathrm{UP}\cap\mathrm{co-UP}\)
• On the \(\mu \)-calculus over transitive and finite transitive frames
• Results on the propositional \(\mu\)-calculus
• A guide to completeness and complexity for modal logics of knowledge and belief
• Propositional dynamic logic of regular programs
• Infinite games on finitely coloured graphs with applications to automata on infinite trees
• The \(\mu\)-calculus alternation depth hierarchy is infinite over finite planar graphs
• The complexity of identifying characteristic formulae
• Tableau methods of proof for modal logics
• On Modal μ-Calculus in S5 and Applications
• Unifying Hyper and Epistemic Temporal Logics
• On the Modal μ-Calculus Over Finite Symmetric Graphs
• The modalμ-calculus hierarchy over restricted classes of transition systems
• The extensions of the modal logic K5
• The Computational Complexity of Provability in Systems of Modal Propositional Logic
• Strongly analytic tableaux for normal modal logics
• Complexity of finite-variable fragments of propositional modal logics of symmetric frames
• Characterizing the NP-PSPACE Gap in the Satisfiability Problem for Modal Logic
• On model checking for the \(\mu\)-calculus and its fragments

This page was built for publication: