A Complete Logic for Behavioural Equivalence in Coalgebras of Finitary Set Functors

DOI10.1007/978-3-319-40370-0_10zbMath1382.68154OpenAlexW2493201457MaRDI QIDQ5739455

David Sprunger

Publication date: 15 July 2016

Published in: Coalgebraic Methods in Computer Science (Search for Journal in Brave)

Full work available at URL: https://hal.inria.fr/hal-01446025/file/418352_1_En_10_Chapter.pdf

Mathematics Subject Classification ID

Logic in computer science (03B70) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Categorical logic, topoi (03G30) Special properties of functors (faithful, full, etc.) (18A22)

Related Items (1)

A complete logic for behavioural equivalence in coalgebras of finitary set functors

Cites Work

• Unnamed Item
• Adjunctions whose counits are coequalizers, and presentations of finitary enriched monads
• Recursion and corecursion have the same equational logic
• Universal coalgebra: A theory of systems
• On the Final Coalgebra of Automatic Sequences
• A Complete Logical System for the Equality of Recursive Terms for Sets
• On Finitary Functors and Their Presentations
• Automatic Sequences and Zip-Specifications
• Presentation of Set Functors: A Coalgebraic Perspective
• Nominal Kleene Coalgebra
• A Kleene Theorem for Polynomial Coalgebras
• The logic of recursive equations
• Enhanced coalgebraic bisimulation

This page was built for publication: A Complete Logic for Behavioural Equivalence in Coalgebras of Finitary Set Functors