A coalgebraic perspective on monotone modal logic

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

56 Citations (Scopus)

Abstract

The paper has two main parts: First we make the connection between monotone modal logic and the general theory of coalgebras precise by defining functors UpP : Set → Set and UpV : Stone → Stone such that UpP- and UpV-coalgebras correspond to monotone neighbourhood frames and descriptive general monotone frames, respectively. Then we investigate the relationship between the coalgcbraic notions of equivalence and monotone bisimulation. In particular, we show that the UpP-functor does not preserve weak pullbacks, and we prove interpolation for a number of monotone modal logics using results on UpP-bisimulations.

Original languageEnglish
Title of host publicationProceedings of the Workshop on Coalgebraic Methods in Computer Science (CMCS 2004)
EditorsJiri Adámek, Stefan Milius
PublisherElsevier
Pages121-143
Number of pages23
Volume106
DOIs
Publication statusPublished - 12-Dec-2004
Externally publishedYes

Publication series

NameElectronic Notes in Theoretical Computer Science
PublisherSpringer
Volume106
ISSN (Print)1571-0661

Keywords

  • Bisimulation
  • Coalgebra
  • Frame
  • Modal logic

Fingerprint

Dive into the research topics of 'A coalgebraic perspective on monotone modal logic'. Together they form a unique fingerprint.

Cite this