Coequational logic for accessible functors

DOI10.1016/J.IC.2009.10.010zbMATH Open1222.03031OpenAlexW2040834264MaRDI QIDQ618173FDOQ618173

Authors: 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

Recommendations

• Coequational logic for finitary functors
• Computer Science Logic
• Birkhoff's covariety theorem without limitations.
• Equational and implicational classes of coalgebras
• Modal predicates and coequations

zbMATH Keywords

coalgebraaccessible functorcoequational logicrepresentative tree

Mathematics Subject Classification ID

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

Cites Work

• Universal coalgebra: A theory of systems
• On tree coalgebras and coalgebra presentations
• Title not available (Why is that?)
• On the final sequence of a finitary set functor
• Coalgebraic logic
• Coalgebraic modal logic: soundness, completeness and decidability of local consequence
• Terminal coalgebras and free iterative theories
• A fixpoint theorem for complete categories
• Computer Science Logic
• Title not available (Why is that?)
• Coalgebras of bounded type
• Recursive coalgebras of finitary functors
• Coequational logic for finitary functors

Cited In (7)

• On final coalgebras of power-set functors and saturated trees
• Coequational logic for finitary functors
• Operators on classes of coalgebras
• Coalgebraic semantics of modal logics: an overview
• Functorial coalgebraic logic: the case of many-sorted varieties
• Duality of Equations and Coequations via Contravariant Adjunctions
• Computer Science Logic

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

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