( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
A Graphical Proof Theory of Logical Time.

, , , и . FSCD, том 228 из LIPIcs, стр. 22:1-22:25. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)

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.

Lutz Straßburger

Benjamin Straßburger

Günther Straßburger

Jürgen Straßburger

Peter Straßburger

 

Другие публикации лиц с тем же именем

Combinatorial Proofs for Constructive Modal Logic., и . AiML, стр. 15-36. College Publications, (2022)Logic Beyond Formulas: A Proof System on Graphs., , и . LICS, стр. 38-52. ACM, (2020)BV and Pomset Logic Are Not the Same., и . CSL, том 216 из LIPIcs, стр. 32:1-32:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)A fully labelled proof system for intuitionistic modal logics., , и . J. Log. Comput., 31 (3): 998-1022 (2021)On Combinatorial Proofs for Modal Logic., и . TABLEAUX, том 11714 из Lecture Notes in Computer Science, стр. 223-240. Springer, (2019)Some Remarks on Nested Sequent Systems for Modal Logics.. TABLEAUX (Workshops, Tutorials, and Short Papers), том IAM-11-002 из Technical Report, стр. 75. (2011)Introduction to Proof Nets.. TABLEAUX (Workshops, Tutorials, and Short Papers), том IAM-11-002 из Technical Report, стр. 79. (2011)Taming Bounded Depth with Nested Sequents., , и . AiML, стр. 199-216. College Publications, (2022)Intuitionistic S4 is decidable., , , , и . LICS, стр. 1-13. IEEE, (2023)Combinatorial Flows as Bicolored Atomic Flows., и . WoLLIC, том 13468 из Lecture Notes in Computer Science, стр. 141-157. Springer, (2022)