Jérémy Ledent

According to our database, Jérémy Ledent authored at least 20 papers between 2017 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

A Many-Sorted Epistemic Logic for Chromatic Hypergraphs.

Éric Goubault, Roman Kniazev, Jérémy Ledent

Proceedings of the 32nd EACSL Annual Conference on Computer Science Logic, 2024

2023

Simplicial Models for the Epistemic Logic of Faulty Agents.

Eric Goubault, Roman Kniazev, Jérémy Ledent, Sergio Rajsbaum

CoRR, 2023

Semi-Simplicial Set Models for Distributed Knowledge.

Éric Goubault, Roman Kniazev, Jérémy Ledent, Sergio Rajsbaum

Proceedings of the 38th Annual ACM/IEEE Symposium on Logic in Computer Science, 2023

2022

A quantitative model for simply typed λ-calculus.

Martin Hofmann, Jérémy Ledent

Math. Struct. Comput. Sci., June, 2022

Two-Agent Approximate Agreement from an Epistemic Logic Perspective.

Jorge Armenta-Segura, Jérémy Ledent, Sergio Rajsbaum

Computación y Sistemas, 2022

A Simplicial Model for KB4_n: Epistemic Logic with Agents That May Die.

Éric Goubault, Jérémy Ledent, Sergio Rajsbaum

Proceedings of the 39th International Symposium on Theoretical Aspects of Computer Science, 2022

2021

A dynamic epistemic logic analysis of equality negation and other epistemic covering tasks.

Hans van Ditmarsch, Éric Goubault, Marijana Lazic, Jérémy Ledent, Sergio Rajsbaum

J. Log. Algebraic Methods Program., 2021

A Simplicial Model for KB4_n: Epistemic Logic with Agents that May Die.

Eric Goubault, Jérémy Ledent, Sergio Rajsbaum

CoRR, 2021

Translating Extensive Form Games to Open Games with Agency.

Matteo Capucci, Neil Ghani, Jérémy Ledent, Fredrik Nordvall Forsberg

Proceedings of the Fourth International Conference on Applied Category Theory, 2021

Brief Announcement: Variants of Approximate Agreement on Graphs and Simplicial Complexes.

Jérémy Ledent

Proceedings of the PODC '21: ACM Symposium on Principles of Distributed Computing, 2021

2020

Compositional Game Theory, Compositionally.

Robert Atkey, Bruno Gavranovic, Neil Ghani, Clemens Kupke, Jérémy Ledent, Fredrik Nordvall Forsberg

Proceedings of the 3rd Annual International Applied Category Theory Conference 2020, 2020

Knowledge and simplicial complexes.

Hans van Ditmarsch, Eric Goubault, Jérémy Ledent, Sergio Rajsbaum

CoRR, 2020

2019

Geometric semantics for asynchronous computability. (Sémantique géométrique pour la calculabilité asynchrone).

Jérémy Ledent

PhD thesis, 2019

Wait-Free Solvability of Equality Negation Tasks.

Éric Goubault, Marijana Lazic, Jérémy Ledent, Sergio Rajsbaum

Proceedings of the 33rd International Symposium on Distributed Computing, 2019

A Dynamic Epistemic Logic Analysis of the Equality Negation Task.

Éric Goubault, Marijana Lazic, Jérémy Ledent, Sergio Rajsbaum

Proceedings of the Dynamic Logic. New Trends and Applications, 2019

A Sound Foundation for the Topological Approach to Task Solvability.

Jérémy Ledent, Samuel Mimram

Proceedings of the 30th International Conference on Concurrency Theory, 2019

2018

A Simplicial Complex Model for Dynamic Epistemic Logic to study Distributed Task Computability.

Éric Goubault, Jérémy Ledent, Sergio Rajsbaum

Proceedings of the Proceedings Ninth International Symposium on Games, 2018

Brief Announcement: On the Impossibility of Detecting Concurrency.

Éric Goubault, Jérémy Ledent, Samuel Mimram

Proceedings of the 32nd International Symposium on Distributed Computing, 2018

Concurrent Specifications Beyond Linearizability.

Éric Goubault, Jérémy Ledent, Samuel Mimram

Proceedings of the 22nd International Conference on Principles of Distributed Systems, 2018

2017

A cartesian-closed category for higher-order model checking.

Martin Hofmann, Jérémy Ledent

Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, 2017