EXPTIME Tableaux for the Coalgebraic μ-Calculus

DOI10.1007/978-3-642-04027-6_15zbMath1257.03045OpenAlexW2244349542MaRDI QIDQ3644748

Dirk Pattinson, Clemens Kupke, Corina Cîrstea

Publication date: 12 November 2009

Published in: Computer Science Logic (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/1885/79038

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Modal logic (including the logic of norms) (03B45) Mechanization of proofs and logical operations (03B35)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Games for the \(\mu\)-calculus
• Results on the propositional \(\mu\)-calculus
• Completeness of Kozen's axiomatisation of the propositional \(\mu\)-calculus.
• Automata and fixed point logic: a coalgebraic perspective
• In so many possible worlds
• Modular Games for Coalgebraic Fixed Point Logics
• PSPACE bounds for rank-1 modal logics
• The Complexity of Tree Automata and Logics of Programs
• A Modal Logic for Coalitional Power in Games
• On the expressivity of the modal mu-calculus
• An automata-theoretic approach to branching-time model checking
• Foundations of Software Science and Computation Structures

Related Items (11)

Coinductive predicates and final sequences in a fibration ⋮ Unnamed Item ⋮ Hybrid logic with the difference modality for generalisations of graphs ⋮ Maximal traces and path-based coalgebraic temporal logics ⋮ Game-theoretic semantics for \(\mathrm{ATL}^+\) with applications to model checking ⋮ Completeness for \(\mu\)-calculi: a coalgebraic approach ⋮ Global Caching for Coalgebraic Description Logics ⋮ Coalgebraic CTL: fixpoint characterization and polynomial-time model checking ⋮ Unnamed Item ⋮ Coinductive predicates and final sequences in a fibration ⋮ A propositional dynamic logic for instantial neighborhood semantics

This page was built for publication: EXPTIME Tableaux for the Coalgebraic μ-Calculus