A finite model construction for coalgebraic modal logic

DOI10.1016/j.jlap.2006.11.004zbMath1127.03014OpenAlexW2142018979MaRDI QIDQ2643335

Lutz Schröder

Publication date: 23 August 2007

Published in: The Journal of Logic and Algebraic Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jlap.2006.11.004

zbMATH Keywords

complexitymodal logiccoalgebradecidabilityfinite model propertyweak completeness

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Logic in computer science (03B70) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Categorical logic, topoi (03G30)

Related Items (12)

Hypersequent rules with restricted contexts for propositional modal logics ⋮ Reasoning with Global Assumptions in Arithmetic Modal Logics ⋮ Cut elimination in coalgebraic logics ⋮ Hybrid logic with the difference modality for generalisations of graphs ⋮ Coalgebraic semantics of modal logics: an overview ⋮ Unnamed Item ⋮ Completeness for \(\mu\)-calculi: a coalgebraic approach ⋮ Modular algorithms for heterogeneous modal logics via multi-sorted coalgebra ⋮ On monotone modalities and adjointness ⋮ Global Caching for Coalgebraic Description Logics ⋮ Coalgebraic Hybrid Logic ⋮ Admissibility of Cut in Coalgebraic Logics

Uses Software

• CCSL

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Expressive logics for coalgebras via terminal sequence induction
• Bisimulation through probabilistic testing
• Coalgebraic logic
• Finality regained: A coalgebraic study of Scott-sets and multisets
• Universal coalgebra: A theory of systems
• Coalgebraic modal logic: soundness, completeness and decidability of local consequence
• Algebraic-coalgebraic specification in CoCASL
• Realizations by stochastic finite automata
• PSPACE Reasoning for Graded Modal Logics
• Presburger Modal Logic Is PSPACE-Complete
• Algebraic laws for nondeterminism and concurrency
• Reasoning about knowledge and probability
• CONCUR 2004 - Concurrency Theory
• Algebra and Coalgebra in Computer Science
• Foundations of Software Science and Computational Structures
• Foundations of Software Science and Computation Structures
• Probability logic for type spaces
• Specifying coalgebras with modal logic

This page was built for publication: A finite model construction for coalgebraic modal logic