Open Access. Powered by Scholars. Published by Universities.®

Other Computer Engineering Commons

Open Access. Powered by Scholars. Published by Universities.®

Chapman University

Other Mathematics

Algebraic theories

Articles 1 - 1 of 1

Full-Text Articles in Other Computer Engineering

Strongly Complete Logics For Coalgebras, Alexander Kurz, Jiří Rosický Jan 2012

Strongly Complete Logics For Coalgebras, Alexander Kurz, Jiří Rosický

Engineering Faculty Articles and Research

Coalgebras for a functor model different types of transition systems in a uniform way. This paper focuses on a uniform account of finitary logics for set-based coalgebras. In particular, a general construction of a logic from an arbitrary set-functor is given and proven to be strongly complete under additional assumptions. We proceed in three parts.

Part I argues that sifted colimit preserving functors are those functors that preserve universal algebraic structure. Our main theorem here states that a functor preserves sifted colimits if and only if it has a finitary presentation by operations and equations. Moreover, the presentation of the ...