David Fernández-Duque

  • Ghent University, Ghent, Belgium
  • University of Toulouse, CIMI, France (former)
  • ITAM, Department of Mathematics, Mexico City, Mexico (former)

According to our database1, David Fernández-Duque authored at least 68 papers between 2006 and 2022.

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



In proceedings 
PhD thesis 


Online presence:

On csauthors.net:


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

A Non-hyperarithmetical Gödel Logic.
Proceedings of the Logical Foundations of Computer Science - International Symposium, 2022

Exploring the Jungle of Intuitionistic Temporal Logics.
Theory Pract. Log. Program., 2021

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

Dynamic Cantor Derivative Logic.
CoRR, 2021

Who holds the best card? Secure communication of optimal secret bits.
Australas. J Comb., 2021

The Topological Mu-Calculus: completeness and decidability.
Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, 2021

Some constructive variants of S4 with the finite model property.
Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, 2021

Intuitionistic Linear Temporal Logics.
ACM Trans. Comput. Log., 2020

Ackermannian Goodstein Sequences of Intermediate Growth.
Proceedings of the Beyond the Horizon of Computability, 2020

The Dynamics of Epistemic Attitudes in Resource-Bounded Agents.
Stud Logica, 2019

Complete Intuitionistic Temporal Logics in Topological Dynamics.
CoRR, 2019

A Self-contained Provability Calculus for Γ<sub>0</sub>.
Proceedings of the Logic, Language, Information, and Computation, 2019

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

Axiomatic Systems and Topological Semantics for Intuitionistic Temporal Logic.
Proceedings of the Logics in Artificial Intelligence - 16th European Conference, 2019

Stratified Evidence Logics.
Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

The intuitionistic temporal logic of dynamical systems.
Log. Methods Comput. Sci., 2018

Succinctness in Subsystems of the Spatial μ-Calculus.
FLAP, 2018

Frame-validity games and lower bounds on the complexity of modal axioms.
CoRR, 2018

Bisimulations for intuitionistic temporal logics.
CoRR, 2018

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

An Intuitionistic Axiomatization of 'Eventually'.
Proceedings of the Advances in Modal Logic 12, 2018

Frame-Validity Games and Absolute Minimality of Modal Axioms.
Proceedings of the Advances in Modal Logic 12, 2018

Verification logic.
J. Log. Comput., 2017

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

Strong Completeness of Provability Logic for Ordinal Spaces.
J. Symb. Log., 2017

Worms and Spiders: Reflection Calculi and Ordinal Notation Systems.
FLAP, 2017

A case study in almost-perfect security for unconditionally secure communication.
Des. Codes Cryptogr., 2017

A Decidable Intuitionistic Temporal Logic.
Proceedings of the 26th EACSL Annual Conference on Computer Science Logic, 2017

Exploring the Bidimensional Space: A Dynamic Logic Point of View.
Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems, 2017

Logical Dynamics.
, 2017

Perfectly secure data aggregation via shifted projections.
Inf. Sci., 2016

Secure aggregation of distributed information: How a team of agents can safely share secrets in front of a spy.
Discret. Appl. Math., 2016

A Logical Theory of Belief Dynamics for Resource-Bounded Agents.
Proceedings of the 2016 International Conference on Autonomous Agents & Multiagent Systems, 2016

Axiomatizing the lexicographic products of modal logics with linear temporal logic.
Proceedings of the Advances in Modal Logic 11, 2016

Verification logic: An arithmetical interpretation for negative introspection.
Proceedings of the Advances in Modal Logic 11, 2016

Forgetting complex propositions.
Log. J. IGPL, 2015

A geometric protocol for cryptography with cards.
Des. Codes Cryptogr., 2015

A fully card-safe protocol for securely aggregating distributed information.
CoRR, 2015

Non-finite axiomatizability of dynamic topological logic.
ACM Trans. Comput. Log., 2014

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

On the definability of simulation and bisimulation in epistemic logic.
J. Log. Comput., 2014

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

Secure aggregation of distributed information.
CoRR, 2014

Evidence and plausibility in neighborhood structures.
Ann. Pure Appl. Log., 2014

The polytopologies of transfinite provability logic.
Arch. Math. Log., 2014

A colouring protocol for the generalized Russian cards problem.
Theor. Comput. Sci., 2013

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

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

A sound and complete axiomatization for Dynamic Topological Logic.
J. Symb. Log., 2012

Dynamic topological logic of metric spaces.
J. Symb. Log., 2012

A modal framework for modelling abductive reasoning.
Log. J. IGPL, 2012

Tableaux for structural abduction.
Log. J. IGPL, 2012

Tangled modal logic for topological dynamics.
Ann. Pure Appl. Log., 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

Evidence Logic: A New Look at Neighborhood Structures.
Proceedings of the Advances in Modal Logic 9, 2012

On the Modal Definability of Simulability by Finite Transitive Models.
Stud Logica, 2011

Dynamic Topological Logic Interpreted over Minimal Systems.
J. Philos. Log., 2011

Electron. Notes Theor. Comput. Sci., 2011

Tangled Modal Logic for Spatial Reasoning.
Proceedings of the IJCAI 2011, 2011

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

On the Definability of Simulability and Bisimilarity by Finite Epistemic Models.
Proceedings of the Computational Logic in Multi-Agent Systems, 2011

Absolute Completeness of S4<sub>u</sub> for Its Measure-Theoretic Semantics.
Proceedings of the Advances in Modal Logic 8, 2010

Non-deterministic semantics for dynamic topological logic.
Ann. Pure Appl. Log., 2009

Dynamic Topological Completeness for R<sup>2</sup>.
Log. J. IGPL, 2007

A polynomial translation of S4 into intuitionistic logic.
J. Symb. Log., 2006