Coalgebraic Completeness-via-Canonicity

Dahlqvist, Fredrik

doi:10.1007/978-3-319-40370-0_11

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2016

2024

Publication Types

Select...

Book2

Other1

Relationship

Self Cite2

Independent1

Authors

Journals

Cited by 3 publications

(1 citation statement)

References 30 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The existence of a natural transformation δ ´1 : GL Ñ T G is also key to the duality between varieties and covarieties and between equations and coequations developed in[88]. It is also crucial to strong completeness proofs in coalgebraic modal logic[81,86].…”

mentioning

confidence: 99%

How to write a coequation

Dahlqvist,

Schmid

2021

Preprint

Self Cite

View full text Add to dashboard Cite

There is a large amount of literature on the topic of covarieties, coequations and coequational specifications, dating back to the early seventies. Nevertheless, coequations have not (yet) emerged as an everyday practical specification formalism for computer scientists. In this review paper, we argue that this is partly due to the multitude of syntaxes for writing down coequations, which seems to have led to some confusion about what coequations are and what they are for. By surveying the literature, we identify four types of syntaxes: coequations-as-corelations, coequations-as-predicates, coequations-as-equations, and coequations-as-modal-formulas. We present each of these in a tutorial fashion, relate them to each other, and discuss their respective uses.

show abstract

mentioning

confidence: 99%