Coalgebraic modal logic: Soundness, completeness and decidability of local consequence D Pattinson Theoretical Computer Science 309 (1-3), 177-193, 2003 | 179 | 2003 |

Expressive logics for coalgebras via terminal sequence induction D Pattinson Notre Dame Journal of Formal Logic 45 (1), 19-33, 2004 | 117 | 2004 |

Modular construction of modal logics C Cîrstea, D Pattinson International Conference on Concurrency Theory, 258-275, 2004 | 104* | 2004 |

PSPACE bounds for rank-1 modal logics L Schröder, D Pattinson ACM Transactions on Computational Logic (TOCL) 10 (2), 1-33, 2009 | 103 | 2009 |

Modal Logics are Coalgebraic^{}C Cîrstea, A Kurz, D Pattinson, L Schröder, Y Venema The Computer Journal 54 (1), 31-41, 2011 | 99 | 2011 |

Algebraic semantics for coalgebraic logics C Kupke, A Kurz, D Pattinson Electronic Notes in Theoretical Computer Science 106, 219-241, 2004 | 72 | 2004 |

Rank-1 modal logics are coalgebraic L Schröder, D Pattinson Journal of Logic and Computation 20 (5), 1113-1147, 2010 | 66 | 2010 |

EXPTIME tableaux for the coalgebraic μ-calculus C Cîrstea, C Kupke, D Pattinson International Workshop on Computer Science Logic, 179-193, 2009 | 59 | 2009 |

Semantical principles in the modal logic of coalgebras D Pattinson Annual Symposium on Theoretical Aspects of Computer Science, 514-526, 2001 | 56 | 2001 |

Representations of stream processors using nested fixed points N Ghani, P Hancock, D Pattinson arXiv preprint arXiv:0905.4813, 2009 | 54 | 2009 |

Coalgebraic semantics of modal logics: an overview C Kupke, D Pattinson Theoretical Computer Science 412 (38), 5070-5094, 2011 | 52 | 2011 |

Ultrafilter extensions for coalgebras C Kupke, A Kurz, D Pattinson International Conference on Algebra and Coalgebra in Computer Science, 263-277, 2005 | 47 | 2005 |

Modular algorithms for heterogeneous modal logics L Schröder, D Pattinson International Colloquium on Automata, Languages, and Programming, 459-471, 2007 | 45 | 2007 |

Coalgebraic modal logic of finite rank A Kurz, D Pattinson Mathematical Structures in Computer Science 15 (3), 453, 2005 | 33 | 2005 |

Sequent systems for Lewis’ conditional logics B Lellmann, D Pattinson European Workshop on Logics in Artificial Intelligence, 320-332, 2012 | 32 | 2012 |

Generic trace semantics and graded monads S Milius, D Pattinson, L Schröder 6th Conference on Algebra and Coalgebra in Computer Science (CALCO 2015), 2015 | 31 | 2015 |

Coalgebraic hybrid logic R Myers, D Pattinson, L Schröder International Conference on Foundations of Software Science and …, 2009 | 31 | 2009 |

An introduction to the theory of coalgebras D Pattinson Course notes for NASSLLI, 2003 | 31 | 2003 |

A domain theoretic account of Picard’s theorem A Edalat, D Pattinson International Colloquium on Automata, Languages, and Programming, 494-505, 2004 | 30 | 2004 |

Generic modal cut elimination applied to conditional logics D Pattinson, L Schröder International Conference on Automated Reasoning with Analytic Tableaux and …, 2009 | 29 | 2009 |