Coequational logic for accessible functors

DOI10.1016/j.ic.2009.10.010zbMath1222.03031OpenAlexW2040834264MaRDI QIDQ618173

Daniel Schwencke

Publication date: 14 January 2011

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2009.10.010

zbMATH Keywords

coalgebraaccessible functorcoequational logicrepresentative tree

Mathematics Subject Classification ID

Logic in computer science (03B70) Abstract data types; algebraic specification (68Q65) Categorical logic, topoi (03G30) General theory of categories and functors (18A99)

Related Items (3)

Coalgebraic semantics of modal logics: an overview ⋮ Duality of Equations and Coequations via Contravariant Adjunctions ⋮ On final coalgebras of power-set functors and saturated trees

Cites Work

• Unnamed Item
• Unnamed Item
• On the final sequence of a finitary set functor
• Coalgebraic logic
• Universal coalgebra: A theory of systems
• Coalgebraic modal logic: soundness, completeness and decidability of local consequence
• On tree coalgebras and coalgebra presentations
• Terminal coalgebras and free iterative theories
• A fixpoint theorem for complete categories
• Coequational Logic for Finitary Functors
• Recursive coalgebras of finitary functors
• Coalgebras of bounded type
• Computer Science Logic

This page was built for publication: Coequational logic for accessible functors