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

DOI10.1016/J.JLAMP.2017.05.001MaRDI QIDQ1683709zbMATH OpenOpenAlexFDO

Authors David Sprunger

Publication date 1 December 2017

Published in Journal of Logical and Algebraic Methods in Programming (Search for Journal in Brave)

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

zbMATH Keywords

signaturebehavioural equivalencebisimulation up tocompositional presentationfinitary functor

Mathematics Subject Classification ID

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

Recommendations

• A Complete Logic for Behavioural Equivalence in Coalgebras of Finitary Set Functors
• Coequational logic for finitary functors
• A note on expressive coalgebraic logics for finitary set functors
• Strongly complete logics for coalgebras
• Characterising behavioural equivalence: Three sides of one coin

Cites work

• A Complete Logic for Behavioural Equivalence in Coalgebras of Finitary Set Functors
• A Kleene Theorem for Polynomial Coalgebras
• A coalgebraic perspective on linear weighted automata
• A complete logical system for the equality of recursive terms for sets
• A final coalgebra theorem
• Adjunctions whose counits are coequalizers, and presentations of finitary enriched monads
• Automatic sequences and zip-specifications
• Enhanced coalgebraic bisimulation
• Monoid-labeled transition systems
• Non-deterministic Kleene coalgebras
• On Finitary Functors and Their Presentations
• On the final coalgebra of automatic sequences
• Origins of the cohomology of groups
• Presentation of set functors: a coalgebraic perspective
• Recursion and corecursion have the same equational logic
• Terminal coalgebras and free iterative theories
• The logic of recursive equations
• Universal coalgebra: A theory of systems

Cited in

(8)

• Coequational logic for finitary functors
• Deduction systems for coalgebras over measurable spaces
• Terminal Sequence Induction via Games
• Precongruences and parametrized coinduction for logics for behavioral equivalence
• Characterising behavioural equivalence: Three sides of one coin
• On the foundations of final coalgebra semantics: non-well-founded sets, partial orders, metric spaces
• Presentation of set functors: a coalgebraic perspective
• A Complete Logic for Behavioural Equivalence in Coalgebras of Finitary Set Functors

This page was built for publication: A complete logic for behavioural equivalence in coalgebras of finitary set functors

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1683709)