| Constructive modalities with provability smack T Litak Leo Esakia on duality in modal and intuitionistic logics, 187-216, 2014 | 49 | 2014 |
| The high-level benefits of low-level sandboxing M Sammler, D Garg, D Dreyer, T Litak Proceedings of the ACM on Programming Languages 4 (POPL), 1-32, 2019 | 41 | 2019 |
| Lewis meets Brouwer: constructive strict implication T Litak, A Visser Indagationes Mathematicae 29 (1), 36-90, 2018 | 40 | 2018 |
| Model Theory and Proof Theory of Coalgebraic Predicate Logic T Litak, D Pattinson, K Sano, L Schröder Logical Methods in Computer Science 14, 2018 | 34* | 2018 |
| Guard your daggers and traces: Properties of guarded (co-) recursion S Milius, T Litak Fundamenta Informaticae 150 (3-4), 407-449, 2017 | 30* | 2017 |
| A van Benthem/Rosen theorem for coalgebraic predicate logic L Schröder, D Pattinson, T Litak Journal of Logic and Computation 27 (3), 749-773, 2017 | 29 | 2017 |
| Negative translations and normal modality T Litak, M Polzer, U Rabenstein 2nd international conference on formal structures for computation and …, 2017 | 29 | 2017 |
| Topological perspective on the hybrid proof rules B ten Cate, T Litak Electronic Notes in Theoretical Computer Science 174 (6), 79-94, 2007 | 23 | 2007 |
| On notions of completeness weaker than Kripke completeness T Litak AiML-2004: Advances in Modal Logic, 235, 2004 | 23 | 2004 |
| An algebraic approach to incompleteness in modal logic T Litak (No Title), 2005 | 22 | 2005 |
| Stone duality for nominal Boolean algebras with И MJ Gabbay, T Litak, D Petrişan International Conference on Algebra and Coalgebra in Computer Science, 192-207, 2011 | 21 | 2011 |
| Complete axiomatizations for XPath fragments B ten Cate, T Litak, M Marx Journal of Applied Logic 8 (2), 153-172, 2010 | 21 | 2010 |
| Some modal aspects of XPath B ten Cate, G Fontaine, T Litak Journal of Applied Non-Classical Logics 20 (3), 139-171, 2010 | 21 | 2010 |
| THE NON-REFLEXIVE COUNTERPART OF GRZ T Litak Bulletin of the Section of Logic 36 (3/4), 195-208, 2007 | 21* | 2007 |
| All finitely axiomatizable tense logics of linear time flows are coNP-complete T Litak, F Wolter Studia Logica 81 (2), 153-165, 2005 | 19 | 2005 |
| Complete additivity and modal incompleteness WH Holliday, T Litak The Review of Symbolic Logic 12 (3), 487-535, 2019 | 18 | 2019 |
| Infinite populations, choice and determinacy T Litak Studia Logica 106 (5), 969-999, 2018 | 18 | 2018 |
| One modal logic to rule them all? WH Holliday, T Litak | 16 | 2018 |
| Relational lattices: From databases to universal algebra T Litak, S Mikulás, J Hidders Journal of Logical and Algebraic Methods in Programming 85 (4), 540-573, 2016 | 16* | 2016 |
| Stability of the Blok theorem T Litak Algebra universalis 58 (4), 385-411, 2008 | 15 | 2008 |
Dirk PattinsonAustralian National UniversityVerified email at anu.edu.au
