| Art der Veröffentlichung: |
Artikel in Konferenzband |
| Autor: |
Lutz Schröder |
| Herausgeber: |
Luca Aceto, Anna Ingólfsdóttir |
| Titel: |
A Finite Model Construction for Coalgebraic Modal Logic |
| Buch / Sammlungs-Titel: |
Foundations Of Software Science And Computation Structures |
| Band: |
3921 |
| Seite(n): |
157 – 171 |
| Serie / Reihe: |
Lecture Notes in Computer Science |
| Erscheinungsjahr: |
2006 |
| Verleger: |
Springer, Berlin |
| Abstract / Kurzbeschreibung: |
In recent years, a tight connection has emerged between modal logic on
the one hand and coalgebras, understood as generic transition systems,
on the other hand. Here, we prove that (finitary) coalgebraic modal
logic has the finite model property. This fact not only reproves known
completeness results for coalgebraic modal logic, which we push further
by establishing that every coalgebraic modal logic admits a complete
axiomatization of rank 1; it also enables us to establish a generic
decidability result and a first complexity bound. Examples covered by
these general results include, besides standard Hennessy-Milner logic,
graded modal logic and probabilistic modal logic.
|
| Internet: |
http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/11690634_11 |
| PDF Version: |
http://www.informatik.uni-bremen.de/~lschrode/papers/CMLfmp.pdf |
| PostScript Version: |
http://www.informatik.uni-bremen.de/~lschrode/papers/CMLfmp.ps |
| Schlagworte: |
Coalgebra modal logic finite model decision procedure probabilistic modal logic |
| Anmerkung / Hinweis: |
EATCS Best Paper Award at ETAPS 2006 |
| Status: |
Reviewed |
| Letzte Aktualisierung: |
02. 11. 2006 |
