C. C??rsteac??rstea, A. Kurz, D. Pattinson, L. Schröder, and Y. Venema, Modal logics are coalgebraic, The Computer Journal, vol.54, pp.31-41, 2011.

C. Kupke and D. Pattinson, Coalgebraic semantics of modal logics: An overview, TCS, vol.412, issue.38, pp.5070-5094, 2011.
DOI : 10.1016/j.tcs.2011.04.023

URL : https://doi.org/10.1016/j.tcs.2011.04.023

J. Rutten, Universal coalgebra: A theory of systems, Theoretical Computer Science, vol.249, pp.3-80, 2000.

H. P. Gumm and T. Schröder, Covarieties and complete covarieties, Theor. Comput. Sci, vol.260, issue.1-2, pp.71-86, 2001.
DOI : 10.1016/s0304-3975(00)00123-7

URL : https://doi.org/10.1016/s0304-3975(00)00123-7

A. Kurz, A Co-Variety-Theorem for Modal Logic, Advances in Modal Logic, vol.2, 1998.

A. Kurz, Logics for Coalgebras and Applications to Computer Science, 2000.

L. S. Moss, Coalgebraic logic, Ann. Pure Appl. Logic, vol.96, issue.1-3, pp.277-317, 1999.

L. S. Moss, Erratum to "coalgebraic logic, Ann. pure appl. logic, vol.96, issue.1-3, pp.241-259, 1999.

D. Pattinson, Coalgebraic modal logic: soundness, completeness and decidability of local consequence, Theor. Comput. Sci, vol.309, issue.1-3, pp.177-193, 2003.

B. Jacobs, Many-sorted coalgebraic modal logic: a model-theoretic study, ITA, vol.35, issue.1, pp.31-59, 2001.

M. Rößiger, Coalgebras and modal logic, Electr. Notes Theor. Comput. Sci, vol.33, pp.294-315, 2000.

R. Goldblatt, Equational logic of polynomial coalgebras, AIML 2002, pp.149-184, 2002.

C. C??rsteac??rstea, A compositional approach to defining logics for coalgebras, Theor. Comput. Sci, vol.327, issue.1-2, pp.45-69, 2004.

C. C??rsteac??rstea and D. Pattinson, Modular construction of complete coalgebraic logics, Theor. Comput. Sci, vol.388, issue.1-3, pp.83-108, 2007.

R. Goldblatt, Final coalgebras and the hennessy-milner property, Ann. Pure Appl. Logic, vol.138, issue.1-3, pp.77-93, 2006.

C. Kupke and R. A. Leal, Characterising behavioural equivalence: Three sides of one coin, Proceedings, pp.97-112, 2009.

P. B. Levy, 6th Conference on Algebra and Coalgebra in Computer Science, vol.35, pp.221-237, 2015.

L. Schröder, Expressivity of coalgebraic modal logic: The limits and beyond, Theoretical Computer Science, vol.390, issue.2, pp.230-247, 2008.

C. Kupke, A. Kurz, and Y. Venema, Stone coalgebras, Theoretical Computer Science, vol.327, pp.109-134, 2004.

L. S. Moss and I. D. Viglizzo, Final coalgebras for functors on measurable spaces, Inf. Comput, vol.204, issue.4, pp.610-636, 2006.

C. Kupke, A. Kurz, and D. Pattinson, Algebraic semantics for coalgebraic modal logic, Proceedings of the Workshop on Coalgebraic Methods in Computer Science (CMCS), vol.106, 2004.

B. Klin, Coalgebraic modal logic beyond sets, ENTCS, vol.173, pp.177-201, 2007.

B. Jacobs and A. Sokolova, Exemplaric expressivity of modal logics, J. Log. Comput, vol.20, issue.5, pp.1041-1068, 2010.

F. Dahlqvist and A. Kurz, The positivication of coalgebraic logics, CALCO 2017, vol.72, p.15, 2017.

B. Klin, Bialgebraic methods and modal logic in structural operational semantics, Inf. Comput, vol.207, issue.2, pp.237-257, 2009.

B. Klin and J. Rot, Coalgebraic trace semantics via forgetful logics, Logical Methods in Computer Science, vol.12, issue.4, 2016.

B. Jacobs, Trace semantics for coalgebras, ENTCS, vol.106, pp.167-184, 2004.

J. Rutten, Relators and Metric Bisimulation, Extended Abstract). Electronic Notes in Theoretical Computer Science, vol.11, pp.1-7, 1998.

C. Kupke and Y. Venema, Coalgebraic automata theory: Basic results, Logical Methods in Computer Science, vol.4, issue.4, 2008.

C. Kupke, A. Kurz, and Y. Venema, Completeness for the coalgebraic cover modality, Logical Methods in Computer Science, vol.8, issue.3, 2012.

M. Bílková, A. Palmigiano, and Y. Venema, Proof systems for Moss' coalgebraic logic, Theor. Comput. Sci, vol.549, pp.36-60, 2014.

L. Santocanale, Completions of µ-algebras, Annals of Pure and Applied Logic, vol.154, issue.1, pp.27-50, 2008.
URL : https://hal.archives-ouvertes.fr/hal-01288855

Y. Venema, Automata and fixpoint logics: a coalgebraic perspective, Inf. Comp, vol.204, pp.637-678, 2006.

G. Fontaine, R. Leal, and Y. Venema, Automata for coalgebras: an approach using predicate liftings, Proc. ICALP 2010, vol.6199, pp.381-392, 2010.

C. C??rsteac??rstea, C. Kupke, and D. Pattinson, EXPTIME tableaux for the coalgebraic µ-calculus, Logical Methods in Computer Science, vol.7, issue.3, 2011.

L. Schröder and D. Pattinson, PSPACE Bounds for Rank-1 Modal Logics, ACM Trans. Comput. Logic, vol.10, issue.2, p.33, 2009.

L. Santocanale and Y. Venema, Completeness for flat modal fixpoint logics, Ann. Pure Appl. Logic, vol.162, issue.1, pp.55-82, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00346782

L. Schröder and Y. Venema, Flat coalgebraic fixed point logics, CONCUR 2010, vol.6269, pp.524-538, 2010.

H. H. Hansen and C. Kupke, Weak completeness of coalgebraic dynamic logics, FICS 2015, pp.90-104, 2015.

S. Enqvist, F. Seifan, and Y. Venema, Completeness for coalgebraic fixpoint logic, CSL 2016, vol.7, p.19, 2016.

H. H. Hansen, C. Kupke, J. Marti, and Y. Venema, Parity games and automata for game logic, DALI 2017, vol.10669, pp.115-132, 2018.

N. Bezhanishvili and C. Kupke, Games for topological fixpoint logic, GandALF 2016, vol.226, pp.46-60, 2016.

S. Barlocco and C. Kupke, Angluin learning via logic, LFCS 2018, vol.10703, pp.72-90, 2018.

D. Angluin, Learning regular sets from queries and counterexamples, Information and Computation, vol.75, issue.2, pp.87-106, 1987.

N. Ghani, C. Kupke, A. Lambert, and F. N. Forsberg, A compositional treatment of iterated open games, 2017.

N. Ghani and J. Hedges, A compositional approach to economic game theory, 2016.