Output details
11 - Computer Science and Informatics
University of Leicester
Article title
COMPLETENESS FOR THE COALGEBRAIC COVER MODALITY
Type
D - Journal article
DOI
-
Title of journal
LOGICAL METHODS IN COMPUTER SCIENCE
Article number
ARTN 02
Volume number
8
Issue number
3
First page of article
-
ISSN of journal
1860-5974
Year of publication
2012
URL
-
Number of additional authors
2
Additional information
<10>In his seminal paper Coalgebraic Logic (1998), Moss gave a logic for coalgebras that is parametric in an arbitrary type constructor. Due to
this amazing generality, it was for a long time completely unclear how
to give one axiomatization of this logic that works uniformly for all
type constructors. This paper solves this problem. It forms the basis for the PhD theses of Leal and Vosmaer and a number of papers such as (Bergfeld, Venema, CALCO'11) and (Pattinson, LICS'13). In (Venema, Vosmaer, Vickers, Math.Struct.Comp.Sci. 2013) it is generalised from Boolean to geometric logic.
Interdisciplinary
-
Cross-referral requested
-
Research group
None
Citation count
2
Proposed double-weighted
No
Double-weighted statement
-
Reserve for a double-weighted output
No
Non-English
No
English abstract
-
