A finitary treatment of the closed fragment of Japaridze's provability logic LD Beklemishev, JJ Joosten, M Vervoort Journal of Logic and Computation 15 (4), 447-463, 2005 | 37 | 2005 |

Modal matters for interpretability logics E Goris, JJ Joosten Logic Journal of the IGPL 16 (4), 371-412, 2008 | 33* | 2008 |

On provability logics with linearly ordered modalities LD Beklemishev, D Fernández-Duque, JJ Joosten Studia Logica 102 (3), 541-566, 2014 | 32 | 2014 |

Interpretability formalized JJ Joosten Quaestiones Infinitae 49, 2004 | 31 | 2004 |

The interpretability logic of all reasonable arithmetical theories JJ Joosten, A Visser Erkenntnis 53 (1-2), 3-26, 2000 | 30 | 2000 |

Models of transfinite provability logic D Fernández-Duque, JJ Joosten Journal of Symbolic Logic 78 (2), 543-561, 2013 | 27 | 2013 |

A new principle in the interpretability logic of all reasonable arithmetical theories E Goris, JJ Joosten Logic Journal of the IGPL 19 (1), 1-17, 2011 | 23 | 2011 |

Empirical encounters with computational irreducibility and unpredictability H Zenil, F Soler-Toscano, JJ Joosten Minds and Machines 22 (3), 149-165, 2012 | 22 | 2012 |

Well-orders in the transfinite Japaridze algebra D Fernández-Duque, JJ Joosten Logic Journal of the IGPL 22 (6), 933-963, 2014 | 21 | 2014 |

Hyperations, Veblen progressions and transfinite iteration of ordinal functions D Fernández-Duque, JJ Joosten Annals of Pure and Applied Logic 164 (7-8), 785-801, 2013 | 18 | 2013 |

Towards the interpretability logic of all reasonable arithmetical theories JJ Joosten Master's Thesis, ILLC, University of Amsterdam, 1998 | 17 | 1998 |

Turing–Taylor expansions for arithmetic theories JJ Joosten Studia Logica 104 (6), 1225-1243, 2016 | 15 | 2016 |

The omega-rule interpretation of transfinite provability logic D Fernández-Duque, JJ Joosten arXiv preprint arXiv:1302.5393, 2013 | 13 | 2013 |

Program-size versus time complexity, speed-up and slowdown phenomena in small Turing machines JJ Joosten, F Soler-Toscano, H Zenil arXiv preprint arXiv:1102.5389, 2011 | 12 | 2011 |

Program-size versus time complexity, speed-up and slowdown phenomena in small Turing machines JJ Joosten, F Soler-Toscano, H Zenil arXiv preprint arXiv:1102.5389, 2011 | 12 | 2011 |

The Closed Fragment of the Interpretability Logic of PRA with a Constant for JJ Joosten Notre Dame Journal of Formal Logic 46 (2), 127-146, 2005 | 11 | 2005 |

The Closed Fragment of the Interpretability Logic of PRA with a Constant for JJ Joosten Notre Dame Journal of Formal Logic 46 (2), 127-146, 2005 | 11 | 2005 |

Kripke Models of Transfinite Provability Logic. D Fernández-Duque, JJ Joosten Advances in Modal Logic 9, 185-199, 2012 | 10 | 2012 |

Turing jumps through provability JJ Joosten Conference on Computability in Europe, 216-225, 2015 | 9 | 2015 |

The closed fragment of il is pspace hard F Bou, JJ Joosten Electronic Notes in Theoretical Computer Science 278, 47-54, 2011 | 9 | 2011 |