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

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

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

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

Modular construction of modal logics C Cîrstea, D Pattinson CONCUR 2004-Concurrency Theory: 15th International Conference, London, UK …, 2004 | 106* | 2004 |

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

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

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 *μ*-CalculusC Cîrstea, C Kupke, D Pattinson Computer Science Logic: 23rd international Workshop, CSL 2009, 18th Annual …, 2009 | 63 | 2009 |

Semantical principles in the modal logic of coalgebras D Pattinson STACS 2001: 18th Annual Symposium on Theoretical Aspects of Computer Science …, 2001 | 62 | 2001 |

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

Ultrafilter extensions for coalgebras C Kupke, A Kurz, D Pattinson CALCO 3629, 263-277, 2005 | 51 | 2005 |

Modular algorithms for heterogeneous modal logics L Schröder, D Pattinson Automata, Languages and Programming: 34th International Colloquium, ICALP …, 2007 | 46 | 2007 |

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 | 37 | 2015 |

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

Sequent systems for Lewis’ conditional logics B Lellmann, D Pattinson Logics in Artificial Intelligence: 13th European Conference, JELIA 2012 …, 2012 | 36 | 2012 |

Cut elimination in coalgebraic logics D Pattinson, L Schröder Information and Computation 208 (12), 1447-1468, 2010 | 34 | 2010 |

Generic modal cut elimination applied to conditional logics D Pattinson, L Schröder Automated Reasoning with Analytic Tableaux and Related Methods: 18th …, 2009 | 34 | 2009 |

A domain theoretic account of Picard’s theorem A Edalat, D Pattinson Automata, Languages and Programming: 31st International Colloquium, ICALP …, 2004 | 33 | 2004 |

Coalgebraic Hybrid Logic. RSR Myers, D Pattinson, L Schröder FoSSaCS, 137-151, 2009 | 32 | 2009 |