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

DOI10.1016/J.JLAMP.2017.05.001zbMATH Open1382.68155OpenAlexW2613196302MaRDI QIDQ1683709FDOQ1683709

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

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

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)

Cites Work

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

Cited In (8)

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

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)