Joost J. Joosten

Publication Activity (10 Years)

Years Active: 2005-2024
Publications (10 Years): 24

Top Topics

Artificial Intelligence

Linearly Ordered

Logical Theories

Top Venues

Advances in Modal Logic

Publications

Ana de Almeida Borges, Mireia González Bedmar, Juan José Conejero Rodríguez, Eduardo Hermo Reyes, Joaquim Casals Buñuel, Joost J. Joosten
UTC Time, Formally Verified. CPP (2024)
Joost J. Joosten, Manuela Montoya García
Le Nozze di Giustizia. Interactions between Artificial Intelligence, Law, Logic, Language and Computation with some case studies in Traffic Regulations and Health Care. CoRR (2024)
Ana de Almeida Borges, Joost J. Joosten
An Escape from Vardanyan's Theorem. J. Symb. Log. 88 (4) (2023)
Joost J. Joosten
Dialogues with algorithms. CoRR (2023)
Moritz Müller, Joost J. Joosten
Model-checking in the Foundations of Algorithmic Law and the Case of Regulation 561. CoRR (2023)
Evan Goris, Marta Bílková, Joost J. Joosten, Luka Mikec
Theory and application of labelling techniques for interpretability logics. Math. Log. Q. 68 (3) (2022)
Ana de Almeida Borges, Mireia González Bedmar, Juan José Conejero Rodríguez, Eduardo Hermo Reyes, Joaquim Casals Buñuel, Joost J. Joosten
FV Time: a formally verified Coq library. CoRR (2022)
David Fernández-Duque, Konstnatinos Papafilippou, Joost J. Joosten
Hyperarithmetical Worm Battles. LFCS (2022)
David Fernández-Duque, Joost J. Joosten, Fedor Pakhomov, Konstnatinos Papafilippou, Andreas Weiermann
Arithmetical and Hyperarithmetical Worm Battles. J. Log. Comput. 32 (8) (2022)
Joost J. Joosten
MüNchhausen Provability. J. Symb. Log. 86 (3) (2021)
Ana de Almeida Borges, Juan José Conejero Rodríguez, David Fernández-Duque, Mireia González Bedmar, Joost J. Joosten
To drive or not to drive: A logical and computational analysis of European transport regulations. Inf. Comput. 280 (2021)
Ana de Almeida Borges, Joost J. Joosten
Quantified Reflection Calculus with One Modality. AiML (2020)
Adán Cabello, Joost J. Joosten
Hidden variables simulating quantum contextuality increasingly violate the Holevo bound. CoRR (2020)
Evan Goris, Joost J. Joosten
Two New Series of Principles in the interpretability Logic of All Reasonable Arithmetical Theories. J. Symb. Log. 85 (1) (2020)
Eduardo Hermo Reyes, Joost J. Joosten
The Logic of Turing Progressions. Notre Dame J. Formal Log. 61 (1) (2020)
Ana de Almeida Borges, Juan José Conejero Rodríguez, David Fernández-Duque, Mireia González Bedmar, Joost J. Joosten
The Second Order Traffic Fine: Temporal Reasoning in European Transport Regulations. TIME (2019)
Ana de Almeida Borges, Joost J. Joosten
The Worm Calculus. Advances in Modal Logic (2018)
Eduardo Hermo Reyes, Joost J. Joosten
Relational Semantics for the Turing Schmerl Calculus. Advances in Modal Logic (2018)
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
When logic lays down the law. CoRR (2018)
David Fernández-Duque, Joost J. Joosten
The omega-rule interpretation of transfinite provability logic. Ann. Pure Appl. Log. 169 (4) (2018)
Andrés Cordón-Franco, David Fernández-Duque, Joost J. Joosten, Francisco Félix Lara Martín
Predicativity through Transfinite Reflection. J. Symb. Log. 82 (3) (2017)
Joost J. Joosten
Turing-Taylor Expansions for Arithmetic Theories. Stud Logica 104 (6) (2016)
Alyssa M. Adams, Hector Zenil, Eduardo Hermo Reyes, Joost J. Joosten
Interacting Behavior and Emerging Complexity. CoRR (2015)
Joost J. Joosten
Turing Jumps Through Provability. CiE (2015)
Eduardo Hermo Reyes, Joost J. Joosten
The Selfish Algorithm. CoRR (2014)
Lev D. Beklemishev, David Fernández-Duque, Joost J. Joosten
On Provability Logics with Linearly Ordered Modalities. Stud Logica 102 (3) (2014)
David Fernández-Duque, Joost J. Joosten
Well-orders in the transfinite Japaridze algebra. Log. J. IGPL 22 (6) (2014)
David Fernández-Duque, Joost J. Joosten
Models of transfinite provability logic. J. Symb. Log. 78 (2) (2013)
Joost J. Joosten, Fernando Soler-Toscano, Hector Zenil
Fractal dimension versus computational complexity. CoRR (2013)
David Fernández-Duque, Joost J. Joosten
Hyperations, Veblen progressions and transfinite iteration of ordinal functions. Ann. Pure Appl. Log. 164 (7-8) (2013)
Thomas F. Icard III, Joost J. Joosten
Provability and Interpretability Logics with Restricted Realizations. Notre Dame J. Formal Log. 53 (2) (2012)
Hector Zenil, Fernando Soler-Toscano, Joost J. Joosten
Empirical Encounters with Computational Irreducibility and Unpredictability. Minds Mach. 22 (3) (2012)
David Fernández-Duque, Joost J. Joosten
Turing Progressions and Their Well-Orders. CiE (2012)
Andrés Cordón-Franco, Hans van Ditmarsch, David Fernández-Duque, Joost J. Joosten, Fernando Soler-Toscano
A secure additive protocol for card players. Australas. J Comb. 54 (2012)
Joost J. Joosten
Complexity fits the fittest CoRR (2012)
Evan Goris, Joost J. Joosten
sentences. Log. J. IGPL 20 (1) (2012)
Joost J. Joosten
On the necessity of complexity CoRR (2012)
David Fernández-Duque, Joost J. Joosten
Kripke Models of Transfinite Provability Logic. Advances in Modal Logic (2012)
Joost J. Joosten, Fernando Soler-Toscano, Hector Zenil
Program-Size versus Time Complexity, Speed-Up and Slowdown Phenomena in Small Turing Machines CoRR (2011)
Michael H. Albert, Andrés Cordón-Franco, Hans van Ditmarsch, David Fernández-Duque, Joost J. Joosten, Fernando Soler-Toscano
Secure Communication of Local States in Interpreted Systems. DCAI (2011)
Joost J. Joosten, Fernando Soler-Toscano, Hector Zenil
Program-size versus Time Complexity Slowdown and Speed-up Phenomena in the Micro-cosmos of Small Turing Machines. Int. J. Unconv. Comput. 7 (5) (2011)
Andrés Cordón-Franco, Hans van Ditmarsch, David Fernández-Duque, Joost J. Joosten, Fernando Soler-Toscano
A secure additive protocol for card players CoRR (2011)
Evan Goris, Joost J. Joosten
A new principle in the interpretability logic of all reasonable arithmetical theories. Log. J. IGPL 19 (1) (2011)
Hector Zenil, Fernando Soler-Toscano, Joost J. Joosten
Empirical Encounters with Computational Irreducibility and Unpredictability CoRR (2011)
Félix Bou, Joost J. Joosten
The Closed Fragment of IL is PSPACE Hard. Electron. Notes Theor. Comput. Sci. 278 (2011)
Adán Cabello, Joost J. Joosten
Hidden Variables Simulating Quantum Contextuality Increasingly Violate the Holevo Bound. UC (2011)
Joost J. Joosten, Fernando Soler-Toscano, Hector Zenil
Complejidad descriptiva y computacional en máquinas de Turing pequeñas CoRR (2010)
Joost J. Joosten
and PRA. Arch. Math. Log. 49 (7-8) (2010)
Marta Bílková, Dick de Jongh, Joost J. Joosten
Interpretability in PRA. Ann. Pure Appl. Log. 161 (2) (2009)
Evan Goris, Joost J. Joosten
Modal Matters for Interpretability Logics. Log. J. IGPL 16 (4) (2008)
Joost J. Joosten
Propositional Proof Systems and Fast Consistency Provers. Notre Dame J. Formal Log. 48 (3) (2007)
Joost J. Joosten
The Closed Fragment of the Interpretability Logic of PRA with a Constant for. Notre Dame J. Formal Log. 46 (2) (2005)
Lev D. Beklemishev, Joost J. Joosten, Marco Vervoort
A Finitary Treatment of the Closed Fragment of Japaridze's Provability Logic. J. Log. Comput. 15 (4) (2005)