( en | de | ru )

 

Disambiguation of "Ledent, Jérémy"

Author of the publication

copydeleteadd this publication to your clipboard
A dynamic epistemic logic analysis of equality negation and other epistemic covering tasks

, , , , and . Journal of Logical and Algebraic Methods in Programming, (2021)#journal.
DOI: https://doi.org/10.1016/j.jlamp.2021.100662

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Jérémy Bluteau

Jérémy Huart

Jérémy Fix

Jérémy Planul

Jérémy Milhau

 

Other publications of authors with the same name

Concurrent Specifications Beyond Linearizability., , and . OPODIS, volume 125 of LIPIcs, page 28:1-28:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)A cartesian-closed category for higher-order model checking., and . LICS, page 1-12. IEEE Computer Society, (2017)A Simplicial Model for KB4_n: Epistemic Logic with Agents That May Die., , and . STACS, volume 219 of LIPIcs, page 33:1-33:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)A Many-Sorted Epistemic Logic for Chromatic Hypergraphs., , and . CSL, volume 288 of LIPIcs, page 30:1-30:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)Geometric semantics for asynchronous computability. (Sémantique géométrique pour la calculabilité asynchrone).. University of Paris-Saclay, France, (2019)Brief Announcement: On the Impossibility of Detecting Concurrency., , and . DISC, volume 121 of LIPIcs, page 50:1-50:4. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)A dynamic epistemic logic analysis of equality negation and other epistemic covering tasks, , , , and . Journal of Logical and Algebraic Methods in Programming, (2021)#journal.Translating Extensive Form Games to Open Games with Agency., , , and . ACT, volume 372 of EPTCS, page 221-234. (2021)Brief Announcement: Variants of Approximate Agreement on Graphs and Simplicial Complexes.. PODC, page 427-430. ACM, (2021)A Sound Foundation for the Topological Approach to Task Solvability., and . CONCUR, volume 140 of LIPIcs, page 34:1-34:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)