Coalgebraic Hybrid Logic

DOI10.1007/978-3-642-00596-1_11zbMath1234.03020OpenAlexW1570729432MaRDI QIDQ3617726

Lutz Schröder, Dirk Pattinson, Robert S. R. Myers

Publication date: 31 March 2009

Published in: Foundations of Software Science and Computational Structures (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-00596-1_11

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Logic in computer science (03B70) Abstract data types; algebraic specification (68Q65)

Related Items (8)

Sequent Systems for Lewis’ Conditional Logics ⋮ A family of dynamic description logics for representing and reasoning about actions ⋮ Reasoning with Global Assumptions in Arithmetic Modal Logics ⋮ Hybrid logic with the difference modality for generalisations of graphs ⋮ Coalgebraic semantics of modal logics: an overview ⋮ A study on multi-dimensional products of graphs and hybrid logics ⋮ Modular algorithms for heterogeneous modal logics via multi-sorted coalgebra ⋮ Global Caching for Coalgebraic Description Logics

Uses Software

• CoLoSS
• Pellet
• FaCT++

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bisimulation through probabilistic testing
• Finality regained: A coalgebraic study of Scott-sets and multisets
• Natural deduction for first-order hybrid logic
• Coalgebraic modal logic: soundness, completeness and decidability of local consequence
• In so many possible worlds
• A finite model construction for coalgebraic modal logic
• Internalization: The Case of Hybrid Logics
• Admissibility of Cut in Coalgebraic Logics
• PSPACE bounds for rank-1 modal logics
• Interpolation for extended modal languages
• Tableau-based Decision Procedures for Hybrid Logic
• Presburger Modal Logic Is PSPACE-Complete
• Quantitative Relativizations of Complexity Classes
• On the complexity of integer programming
• Alternation
• Reasoning about knowledge and probability
• A Modal Logic for Coalitional Power in Games
• Termination for Hybrid Tableaus
• Transfer Results for Hybrid Logic. Part I: The Case Without Satisfaction Operators
• Probability logic for type spaces

This page was built for publication: Coalgebraic Hybrid Logic