Interpretability formalized. - Joost Johannes Joosten (2004)

A Finitary Treatment of the Closed Fragment of Japaridze's Provability Logic. - Lev D. Beklemishev; Joost J. Joosten; Marco Vervoort (J. Log. Comput., 2005)

The Closed Fragment of the Interpretability Logic of PRA with a Constant for. - Joost J. Joosten (Notre Dame J. Formal Log., 2005)

Propositional Proof Systems and Fast Consistency Provers. - Joost J. Joosten (Notre Dame J. Formal Log., 2007)

Modal Matters for Interpretability Logics. - Evan Goris; Joost J. Joosten (Log. J. IGPL, 2008)

Interpretability in PRA. - Marta Bílková; Dick de Jongh; Joost J. Joosten (Ann. Pure Appl. Log., 2009)

Consistency statements and iterations of computable functions in ISigma1 and PRA. - Joost J. Joosten (Arch. Math. Log., 2010)

Complejidad descriptiva y computacional en máquinas de Turing pequeñas - Joost J. Joosten; Fernando Soler-Toscano; Hector Zenil (CoRR, 2010)

Secure Communication of Local States in Interpreted Systems. - Michael H. Albert; Andrés Cordón-Franco; Hans van Ditmarsch; David Fernández-Duque; Joost J. Joosten; Fernando Soler-Toscano (DCAI, 2011)

Hidden Variables Simulating Quantum Contextuality Increasingly Violate the Holevo Bound. - Adán Cabello; Joost J. Joosten (UC, 2011)

Program-Size versus Time Complexity, Speed-Up and Slowdown Phenomena in Small Turing Machines - Joost J. Joosten; Fernando Soler-Toscano; Hector Zenil (CoRR, 2011)

The Closed Fragment of IL is PSPACE Hard. - Félix Bou; Joost J. Joosten (M4M/LAMAS, 2011)

A new principle in the interpretability logic of all reasonable arithmetical theories. - Evan Goris; Joost J. Joosten (Log. J. IGPL, 2011)

Program-size versus Time Complexity Slowdown and Speed-up Phenomena in the Micro-cosmos of Small Turing Machines. - Joost J. Joosten; Fernando Soler-Toscano; Hector Zenil (Int. J. Unconv. Comput., 2011)

Kripke Models of Transfinite Provability Logic. - David Fernández-Duque; Joost J. Joosten (Advances in Modal Logic, 2012)

Turing Progressions and Their Well-Orders. - David Fernández-Duque; Joost J. Joosten (CiE, 2012)

A secure additive protocol for card players. - Andrés Cordón-Franco; Hans van Ditmarsch; David Fernández-Duque; Joost J. Joosten; Fernando Soler-Toscano (Australas. J Comb., 2012)

On the necessity of complexity - Joost J. Joosten (CoRR, 2012)

Complexity fits the fittest - Joost J. Joosten (CoRR, 2012)

Self provers and Σ1 sentences. - Evan Goris; Joost J. Joosten (Log. J. IGPL, 2012)

Empirical Encounters with Computational Irreducibility and Unpredictability. - Hector Zenil; Fernando Soler-Toscano; Joost J. Joosten (Minds Mach., 2012)

Provability and Interpretability Logics with Restricted Realizations. - Thomas F. Icard III; Joost J. Joosten (Notre Dame J. Formal Log., 2012)

Hyperations, Veblen progressions and transfinite iteration of ordinal functions. - David Fernández-Duque; Joost J. Joosten (Ann. Pure Appl. Log., 2013)

Fractal dimension versus computational complexity. - Joost J. Joosten; Fernando Soler-Toscano; Hector Zenil (CoRR, 2013)

Models of transfinite provability logic. - David Fernández-Duque; Joost J. Joosten (J. Symb. Log., 2013)

The Selfish Algorithm. - Eduardo Hermo Reyes; Joost J. Joosten (CoRR, 2014)

Well-orders in the transfinite Japaridze algebra. - David Fernández-Duque; Joost J. Joosten (Log. J. IGPL, 2014)

On Provability Logics with Linearly Ordered Modalities. - Lev D. Beklemishev; David Fernández-Duque; Joost J. Joosten (Stud Logica, 2014)

Turing Jumps Through Provability. - Joost J. Joosten (CiE, 2015)

Interacting Behavior and Emerging Complexity. - Alyssa M. Adams; Hector Zenil; Eduardo Hermo Reyes; Joost J. Joosten (CoRR, 2015)

Turing-Taylor Expansions for Arithmetic Theories. - Joost J. Joosten (Stud Logica, 2016)

Predicativity through Transfinite Reflection. - Andrés Cordón-Franco; David Fernández-Duque; Joost J. Joosten; Francisco Félix Lara Martín (J. Symb. Log., 2017)

The Worm Calculus. - Ana de Almeida Borges; Joost J. Joosten (Advances in Modal Logic, 2018)

Relational Semantics for the Turing Schmerl Calculus. - Eduardo Hermo Reyes; Joost J. Joosten (Advances in Modal Logic, 2018)

The omega-rule interpretation of transfinite provability logic. - David Fernández-Duque; Joost J. Joosten (Ann. Pure Appl. Log., 2018)

When logic lays down the law. - Bjørn Jespersen; Ana de Almeida Borges; Jorge del Castillo Tierz; Juan José Conejero Rodríguez; Eric Sancho Adamson; Aleix Solé Sánchez; Nika Pona; Joost J. Joosten (CoRR, 2018)

The Second Order Traffic Fine: Temporal Reasoning in European Transport Regulations. - Ana de Almeida Borges; Juan José Conejero Rodríguez; David Fernández-Duque; Mireia González Bedmar; Joost J. Joosten (TIME, 2019)

Quantified Reflection Calculus with One Modality. - Ana de Almeida Borges; Joost J. Joosten (AiML, 2020)

Two New Series of Principles in the interpretability Logic of All Reasonable Arithmetical Theories. - Evan Goris; Joost J. Joosten (J. Symb. Log., 2020)

The Logic of Turing Progressions. - Eduardo Hermo Reyes; Joost J. Joosten (Notre Dame J. Formal Log., 2020)

To drive or not to drive: A logical and computational analysis of European transport regulations. - Ana de Almeida Borges; Juan José Conejero Rodríguez; David Fernández-Duque; Mireia González Bedmar; Joost J. Joosten (Inf. Comput., 2021)

MüNchhausen Provability. - Joost J. Joosten (J. Symb. Log., 2021)

Hyperarithmetical Worm Battles. - David Fernández-Duque; Konstantinos Papafilippou; Joost J. Joosten (LFCS, 2022)

FV Time: a formally verified Coq library. - Ana de Almeida Borges; Mireia González Bedmar; Juan José Conejero Rodríguez; Eduardo Hermo Reyes; Joaquim Casals Buñuel; Joost J. Joosten (CoRR, 2022)

Arithmetical and Hyperarithmetical Worm Battles. - David Fernández-Duque; Joost J. Joosten; Fedor Pakhomov; Konstantinos Papafilippou; Andreas Weiermann (J. Log. Comput., 2022)

Theory and application of labelling techniques for interpretability logics. - Evan Goris; Marta Bílková; Joost J. Joosten; Luka Mikec (Math. Log. Q., 2022)

Model-checking in the Foundations of Algorithmic Law and the Case of Regulation 561. - Moritz Müller; Joost J. Joosten (CoRR, 2023)

Dialogues with algorithms. - Joost J. Joosten (CoRR, 2023)

An Escape from Vardanyan's Theorem. - Ana de Almeida Borges; Joost J. Joosten (J. Symb. Log., 2023)

A Tree Rewriting System for the Reflection Calculus. - Sofía Santiago-Fernández; Joost J. Joosten; David Fernández-Duque (AiML, 2024)

UTC Time, Formally Verified. - Ana de Almeida Borges; Mireia González Bedmar; Juan José Conejero Rodríguez; Eduardo Hermo Reyes; Joaquim Casals Buñuel; Joost J. Joosten (CPP, 2024)

Le Nozze di Giustizia. Interactions between Artificial Intelligence, Law, Logic, Language and Computation with some case studies in Traffic Regulations and Health Care. - Joost J. Joosten; Manuela Montoya García (CoRR, 2024)

On Tame Semantics for Interpretability Logic. - Vicent Navarro Arroyo; Joost J. Joosten (WoLLIC, 2025)

Specification languages for computational laws versus basic legal principles. - Petia Guintchev; Joost J. Joosten; Sofía Santiago-Fernández; Eric Sancho Adamson; Aleix Solé Sánchez; Marta Soria Heredia (CoRR, 2025)

Tree Rewriting Calculi for Strictly Positive Logics. - Sofía Santiago-Fernández; David Fernández-Duque; Joost J. Joosten (CoRR, 2025)