Coequational Logic for Finitary Functors

DOI10.1016/j.entcs.2008.05.028zbMath1279.03088OpenAlexW2019940009MaRDI QIDQ2873671

Daniel Schwencke

Publication date: 24 January 2014

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.entcs.2008.05.028

zbMATH Keywords

logiccoequationpreimagecofree coalgebrafinitary functor

Mathematics Subject Classification ID

Categorical logic, topoi (03G30)

Related Items (1)

Coequational logic for accessible functors

Cites Work

• 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
• Recursive coalgebras of finitary functors
• Modal Operators for Coequations
• Computer Science Logic

This page was built for publication: Coequational Logic for Finitary Functors