Strongly complete logics for coalgebras

• Authors: KURZ Alexander; ROSICKÝ Jiří
• Year of publication: 2012
• Type: Article in Periodical
• Magazine / Source: Logical Methods in Computer Science
• MU Faculty or unit: Faculty of Science
• Doi: http://dx.doi.org/10.2168/LMCS-8(3:14)2012
• Field: General mathematics
• Keywords: coalgebra;modal logic;algebraic theroy

Attached files

• Rstrcompl.09.pdf

• Description: The paper focuses on a uniform account of finitary logics for set-based coalgebras. There is presented a general construction which turns out to be strongly complete.

Related projects

• Institute for Theoretical Computer Science