For the current REF see the REF 2021 website REF 2021 logo

Output details

11 - Computer Science and Informatics

University of Strathclyde

Return to search Previous output Next output
Output 18 of 84 in the submission
Article title

Completeness for the coalgebraic cover modality

Type
D - Journal article
Title of journal
Logical Methods in Computer Science
Article number
2
Volume number
8
Issue number
3
First page of article
-
ISSN of journal
1860-5974
Year of publication
2012
Number of additional authors
2
Additional information

<10>This paper's significance is its solution the long-standing open problem of providing a sound and complete axiomatisation for Moss' coalgebraic logic. This is important because it demonstrates that a large variety of modal logics can be studied uniformly in the type of systems they describe. The paper was agenda setting in sparking a lot of interest of other researchers in this logic and ideas from our paper form the basis of several follow-up works (cf. Bilkova, Palmigiano & Venema / Venema, Vickers & Vosmaer/ Bilkova, Kurz, Petrisan & Velebil / Pattinson).

Interdisciplinary
-
Cross-referral requested
-
Research group
A - Theoretical Computer Science
Citation count
2
Proposed double-weighted
No
Double-weighted statement
-
Reserve for a double-weighted output
No
Non-English
No
English abstract
-