| Coalgebraic modal logic: Soundness, completeness and decidability of local consequence D Pattinson Theoretical Computer Science 309 (1-3), 177-193, 2003 | 201 | 2003 |
| Expressive logics for coalgebras via terminal sequence induction D Pattinson Notre Dame Journal of Formal Logic 45 (1), 19-33, 2004 | 138 | 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 | 122 | 2011 |
| Modular construction of modal logics C Cîrstea, D Pattinson International Conference on Concurrency Theory, 258-275, 2004 | 110* | 2004 |
| PSPACE bounds for rank-1 modal logics L Schröder, D Pattinson ACM Transactions on Computational Logic (TOCL) 10 (2), 1-33, 2009 | 108 | 2009 |
| Coalgebraic semantics of modal logics: An overview C Kupke, D Pattinson Theoretical Computer Science 412 (38), 5070-5094, 2011 | 82 | 2011 |
| Algebraic semantics for coalgebraic logics C Kupke, A Kurz, D Pattinson Electronic Notes in Theoretical Computer Science 106, 219-241, 2004 | 80 | 2004 |
| EXPTIME tableaux for the coalgebraic mu-calculus C Cîrstea, C Kupke, D Pattinson Logical Methods in Computer Science 7, 2011 | 71 | 2011 |
| Rank-1 modal logics are coalgebraic L Schröder, D Pattinson Journal of Logic and Computation 20 (5), 1113-1147, 2010 | 68 | 2010 |
| Representations of stream processors using nested fixed points N Ghani, P Hancock, D Pattinson Logical methods in computer science 5, 2009 | 68 | 2009 |
| Semantical principles in the modal logic of coalgebras D Pattinson Annual Symposium on Theoretical Aspects of Computer Science, 514-526, 2001 | 60 | 2001 |
| Ultrafilter extensions for coalgebras C Kupke, A Kurz, D Pattinson Algebra and Coalgebra in Computer Science: First International Conference …, 2005 | 55 | 2005 |
| 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 | 46 | 2015 |
| Modular algorithms for heterogeneous modal logics L Schröder, D Pattinson International Colloquium on Automata, Languages, and Programming, 459-471, 2007 | 43 | 2007 |
| Sequent systems for Lewis’ conditional logics B Lellmann, D Pattinson European Workshop on Logics in Artificial Intelligence, 320-332, 2012 | 38 | 2012 |
| Coalgebraic modal logic of finite rank A Kurz, D Pattinson Mathematical Structures in Computer Science 15 (3), 453-473, 2005 | 38 | 2005 |
| Generic modal cut elimination applied to conditional logics D Pattinson, L Schröder Logical Methods in Computer Science 7, 2011 | 35 | 2011 |
| Coalgebraic hybrid logic R Myers, D Pattinson, L Schröder Foundations of Software Science and Computational Structures: 12th …, 2009 | 35 | 2009 |
| An introduction to the theory of coalgebras D Pattinson Course notes for NASSLLI, 2003 | 35 | 2003 |
| Cut elimination in coalgebraic logics D Pattinson, L Schröder Information and Computation 208 (12), 1447-1468, 2010 | 33 | 2010 |
