Strongly Complete Logics for Coalgebras
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...
Na minha lista:
| Principais autores: | , |
|---|---|
| Formato: | Artigo |
| Idioma: | Inglês |
| Publicado em: |
Logical Methods in Computer Science e.V.
2012-09-01
|
| Colecção: | Logical Methods in Computer Science |
| Assuntos: | |
| Acesso em linha: | https://lmcs.episciences.org/1231/pdf |
| Tags: |
Sem tags, seja o primeiro a adicionar uma tag!
|