Coalgebraic Completeness-via-Canonicity - Coalgebraic Methods in Computer Science
Conference Papers Year : 2016

Coalgebraic Completeness-via-Canonicity

Fredrik Dahlqvist
  • Function : Author
  • PersonId : 999348
University College of London [London]

Abstract

We present the technique of completeness-via-canonicity in a coalgebraic setting and apply it to both positive and boolean coalgebraic logics with relational semantics.

Domains

Computer Science [cs]
Fichier principal
Vignette du fichier
418352_1_En_11_Chapter.pdf (420.67 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Hal Ifip  : Connect in order to contact the contributor

https://inria.hal.science/hal-01446026

Submitted on : Wednesday, January 25, 2017-3:24:12 PM

Last modification on : Wednesday, January 25, 2017-3:31:58 PM

Long-term archiving on : Wednesday, April 26, 2017-3:32:02 PM

Download

Dates and versions

hal-01446026 , version 1 (25-01-2017)

Licence

Attribution

Identifiers

Cite

Fredrik Dahlqvist. Coalgebraic Completeness-via-Canonicity. 13th International Workshop on Coalgebraic Methods in Computer Science (CMCS), Apr 2016, Eindhoven, Netherlands. pp.174-194, ⟨10.1007/978-3-319-40370-0_11⟩. ⟨hal-01446026⟩

Export

BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite

Collections

IFIP-LNCS IFIP IFIP-TC IFIP-TC1 IFIP-LNCS-9608 IFIP-WG1-3 IFIP-CMCS
37 View
92 Download

Altmetric

Share

More