Presenting functors on many-sorted varieties and applications

10 years 10 months ago
Presenting functors on many-sorted varieties and applications
This paper studies several applications of the notion of a presentation of a functor by operations and equations. We show that the technically straightforward generalisation of this notion from the one-sorted to the many-sorted case has several interesting consequences. First, it can be applied to give equational logic for the binding algebras g abstract syntax. Second, it provides a categorical approach to algebraic semantics of first-order logic. Third, this notion links the uniform treatment of logics for coalgebras of an arbitrary type T with concrete syntax and proof systems. Analysing the many-sorted case is essential for modular completeness proofs of coalgebraic logics. Contents
Alexander Kurz, Daniela Petrisan
Added 25 Jan 2011
Updated 25 Jan 2011
Type Journal
Year 2010
Authors Alexander Kurz, Daniela Petrisan
Comments (0)