Joost J. Joosten

Manuela Montoya García

CoRR, 2024

UTC Time, Formally Verified.

[BibT_eX]

[DOI]

Joaquim Casals Buñuel

Proceedings of the 13th ACM SIGPLAN International Conference on Certified Programs and Proofs, 2024

A Tree Rewriting System for the Reflection Calculus.

[BibT_eX]

Sofía Santiago-Fernández

Proceedings of the Advances in Modal Logic, AiML 2024, Prague, Czech Republic, 2024

2023

An Escape from Vardanyan's Theorem.

[BibT_eX]

[DOI]

J. Symb. Log., 2023

Dialogues with algorithms.

[BibT_eX]

[DOI]

CoRR, 2023

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

[BibT_eX]

[DOI]

Moritz Müller

CoRR, 2023

2022

Theory and application of labelling techniques for interpretability logics.

[BibT_eX]

[DOI]

Math. Log. Q., 2022

Arithmetical and Hyperarithmetical Worm Battles.

[BibT_eX]

[DOI]

Konstantinos Papafilippou

Fedor Pakhomov

Andreas Weiermann

J. Log. Comput., 2022

FV Time: a formally verified Coq library.

[BibT_eX]

[DOI]

Joaquim Casals Buñuel

CoRR, 2022

Hyperarithmetical Worm Battles.

[BibT_eX]

[DOI]

Konstantinos Papafilippou

Proceedings of the Logical Foundations of Computer Science - International Symposium, 2022

2021

MüNchhausen Provability.

[BibT_eX]

[DOI]

J. Symb. Log., 2021

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

[BibT_eX]

[DOI]

Inf. Comput., 2021

2020

The Logic of Turing Progressions.

[BibT_eX]

[DOI]

Notre Dame J. Formal Log., 2020

Two New Series of Principles in the interpretability Logic of All Reasonable Arithmetical Theories.

[BibT_eX]

[DOI]

J. Symb. Log., 2020

Quantified Reflection Calculus with One Modality.

[BibT_eX]

[DOI]

Proceedings of the 13th Conference on Advances in Modal Logic, 2020

2019

The Second Order Traffic Fine: Temporal Reasoning in European Transport Regulations.

[BibT_eX]

[DOI]

Proceedings of the 26th International Symposium on Temporal Representation and Reasoning, 2019

2018

When logic lays down the law.

[BibT_eX]

[DOI]

Bjørn Jespersen

Jorge del Castillo Tierz

CoRR, 2018

The omega-rule interpretation of transfinite provability logic.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 2018

Relational Semantics for the Turing Schmerl Calculus.

[BibT_eX]

[DOI]

Proceedings of the Advances in Modal Logic 12, 2018

The Worm Calculus.

[BibT_eX]

[DOI]

Proceedings of the Advances in Modal Logic 12, 2018

2017

Predicativity through Transfinite Reflection.

[BibT_eX]

[DOI]

Andrés Cordón-Franco

Francisco Félix Lara Martín

J. Symb. Log., 2017

2016

Turing-Taylor Expansions for Arithmetic Theories.

[BibT_eX]

[DOI]

Stud Logica, 2016

2015

Interacting Behavior and Emerging Complexity.

[BibT_eX]

[DOI]

CoRR, 2015

Turing Jumps Through Provability.

[BibT_eX]

[DOI]

Proceedings of the Evolving Computability - 11th Conference on Computability in Europe, 2015

2014

On Provability Logics with Linearly Ordered Modalities.

[BibT_eX]

[DOI]

Lev D. Beklemishev

Stud Logica, 2014

Well-orders in the transfinite Japaridze algebra.

[BibT_eX]

[DOI]

Log. J. IGPL, 2014

The Selfish Algorithm.

[BibT_eX]

[DOI]

CoRR, 2014

2013

Models of transfinite provability logic.

[BibT_eX]

[DOI]

J. Symb. Log., 2013

Fractal dimension versus computational complexity.

[BibT_eX]

[DOI]

CoRR, 2013

Hyperations, Veblen progressions and transfinite iteration of ordinal functions.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 2013

2012

Provability and Interpretability Logics with Restricted Realizations.

[BibT_eX]

[DOI]

Thomas F. Icard III

Notre Dame J. Formal Log., 2012

Empirical Encounters with Computational Irreducibility and Unpredictability.

[BibT_eX]

[DOI]

Minds Mach., 2012

Self provers and Σ<sub>1</sub> sentences.

[BibT_eX]

[DOI]

Log. J. IGPL, 2012

Complexity fits the fittest

[BibT_eX]

[DOI]

CoRR, 2012

On the necessity of complexity

[BibT_eX]

[DOI]

CoRR, 2012

A secure additive protocol for card players.

[BibT_eX]

[DOI]

Andrés Cordón-Franco

Hans van Ditmarsch

Australas. J Comb., 2012

Turing Progressions and Their Well-Orders.

[BibT_eX]

[DOI]

Proceedings of the How the World Computes, 2012

Kripke Models of Transfinite Provability Logic.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Int. J. Unconv. Comput., 2011

A new principle in the interpretability logic of all reasonable arithmetical theories.

[BibT_eX]

[DOI]

Log. J. IGPL, 2011

The Closed Fragment of IL is PSPACE Hard.

[BibT_eX]

[DOI]

Félix Bou

Proceedings of the 7th Workshop on Methods for Modalities, 2011

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

[BibT_eX]

[DOI]

CoRR, 2011

Hidden Variables Simulating Quantum Contextuality Increasingly Violate the Holevo Bound.

[BibT_eX]

[DOI]

Adán Cabello

Proceedings of the Unconventional Computation - 10th International Conference, 2011

Secure Communication of Local States in Interpreted Systems.

[BibT_eX]

[DOI]

Michael H. Albert

Andrés Cordón-Franco

Hans van Ditmarsch

Proceedings of the International Symposium on Distributed Computing and Artificial Intelligence, 2011

2010

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

[BibT_eX]

[DOI]

CoRR, 2010

Consistency statements and iterations of computable functions in ISigma<sub>1</sub> and PRA.

[BibT_eX]

[DOI]

Arch. Math. Log., 2010

2009

Interpretability in PRA.

[BibT_eX]

[DOI]

Marta Bílková

Dick de Jongh

Ann. Pure Appl. Log., 2009

2008

Modal Matters for Interpretability Logics.

[BibT_eX]

[DOI]

Log. J. IGPL, 2008

2007

Propositional Proof Systems and Fast Consistency Provers.

[BibT_eX]

[DOI]

Notre Dame J. Formal Log., 2007

2005

The Closed Fragment of the Interpretability Logic of PRA with a Constant for.

[BibT_eX]

[DOI]

Notre Dame J. Formal Log., 2005

A Finitary Treatment of the Closed Fragment of Japaridze's Provability Logic.

[BibT_eX]

[DOI]

Lev D. Beklemishev