Joost J. Joosten

Orcid: 0000-0001-9590-5045

According to our database1, Joost J. Joosten authored at least 51 papers between 2004 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
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

UTC Time, Formally Verified.
Proceedings of the 13th ACM SIGPLAN International Conference on Certified Programs and Proofs, 2024

2023
An Escape from Vardanyan's Theorem.
J. Symb. Log., 2023

Dialogues with algorithms.
CoRR, 2023

Model-checking in the Foundations of Algorithmic Law and the Case of Regulation 561.
CoRR, 2023

2022
Theory and application of labelling techniques for interpretability logics.
Math. Log. Q., 2022

Arithmetical and Hyperarithmetical Worm Battles.
J. Log. Comput., 2022

FV Time: a formally verified Coq library.
CoRR, 2022

Hyperarithmetical Worm Battles.
Proceedings of the Logical Foundations of Computer Science - International Symposium, 2022

2021
MüNchhausen Provability.
J. Symb. Log., 2021

To drive or not to drive: A logical and computational analysis of European transport regulations.
Inf. Comput., 2021

2020
The Logic of Turing Progressions.
Notre Dame J. Formal Log., 2020

Two New Series of Principles in the interpretability Logic of All Reasonable Arithmetical Theories.
J. Symb. Log., 2020

Quantified Reflection Calculus with One Modality.
Proceedings of the 13th Conference on Advances in Modal Logic, 2020

2019
The Second Order Traffic Fine: Temporal Reasoning in European Transport Regulations.
Proceedings of the 26th International Symposium on Temporal Representation and Reasoning, 2019

2018
When logic lays down the law.
CoRR, 2018

The omega-rule interpretation of transfinite provability logic.
Ann. Pure Appl. Log., 2018

Relational Semantics for the Turing Schmerl Calculus.
Proceedings of the Advances in Modal Logic 12, 2018

The Worm Calculus.
Proceedings of the Advances in Modal Logic 12, 2018

2017
Predicativity through Transfinite Reflection.
J. Symb. Log., 2017

2016
Turing-Taylor Expansions for Arithmetic Theories.
Stud Logica, 2016

2015
Interacting Behavior and Emerging Complexity.
CoRR, 2015

Turing Jumps Through Provability.
Proceedings of the Evolving Computability - 11th Conference on Computability in Europe, 2015

2014
On Provability Logics with Linearly Ordered Modalities.
Stud Logica, 2014

Well-orders in the transfinite Japaridze algebra.
Log. J. IGPL, 2014

The Selfish Algorithm.
CoRR, 2014

2013
Models of transfinite provability logic.
J. Symb. Log., 2013

Fractal dimension versus computational complexity.
CoRR, 2013

Hyperations, Veblen progressions and transfinite iteration of ordinal functions.
Ann. Pure Appl. Log., 2013

2012
Provability and Interpretability Logics with Restricted Realizations.
Notre Dame J. Formal Log., 2012

Empirical Encounters with Computational Irreducibility and Unpredictability.
Minds Mach., 2012

Self provers and Σ<sub>1</sub> sentences.
Log. J. IGPL, 2012

Complexity fits the fittest
CoRR, 2012

On the necessity of complexity
CoRR, 2012

A secure additive protocol for card players.
Australas. J Comb., 2012

Turing Progressions and Their Well-Orders.
Proceedings of the How the World Computes, 2012

Kripke Models of Transfinite Provability Logic.
Proceedings of the Advances in Modal Logic 9, 2012

2011
Program-size versus Time Complexity Slowdown and Speed-up Phenomena in the Micro-cosmos of Small Turing Machines.
Int. J. Unconv. Comput., 2011

A new principle in the interpretability logic of all reasonable arithmetical theories.
Log. J. IGPL, 2011

The Closed Fragment of IL is PSPACE Hard.
Proceedings of the 7th Workshop on Methods for Modalities, 2011

Program-Size versus Time Complexity, Speed-Up and Slowdown Phenomena in Small Turing Machines
CoRR, 2011

Hidden Variables Simulating Quantum Contextuality Increasingly Violate the Holevo Bound.
Proceedings of the Unconventional Computation - 10th International Conference, 2011

Secure Communication of Local States in Interpreted Systems.
Proceedings of the International Symposium on Distributed Computing and Artificial Intelligence, 2011

2010
Complejidad descriptiva y computacional en máquinas de Turing pequeñas
CoRR, 2010

Consistency statements and iterations of computable functions in ISigma<sub>1</sub> and PRA.
Arch. Math. Log., 2010

2009
Interpretability in PRA.
Ann. Pure Appl. Log., 2009

2008
Modal Matters for Interpretability Logics.
Log. J. IGPL, 2008

2007
Propositional Proof Systems and Fast Consistency Provers.
Notre Dame J. Formal Log., 2007

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

A Finitary Treatment of the Closed Fragment of Japaridze's Provability Logic.
J. Log. Comput., 2005

2004
Interpretability formalized.
PhD thesis, 2004


  Loading...