( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
A Complete Axiomatisation for Quantifier-Free Separation Logic.

, , и . Log. Methods Comput. Sci., (2021)

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.

Stéphane Müller

Stéphane Haussler

Stéphane Klein

Stéphane Aubry

Stéphane Audière

 

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

A Complete Axiomatisation for Quantifier-Free Separation Logic., , и . CoRR, (2020)A Completeness Proof for a Logic with an Alternative Necessity Operator.. Stud Logica, 58 (1): 99-112 (1997)Computational Complexity of Multimodal Logics Based on Rough Sets., и . Fundam. Informaticae, 44 (4): 373-396 (2000)Model-Checking Bounded Multi-Pushdown Systems., и . CSR, том 7913 из Lecture Notes in Computer Science, стр. 405-417. Springer, (2013)Axiomatising Logics with Separating Conjunction and Modalities., , и . JELIA, том 11468 из Lecture Notes in Computer Science, стр. 692-708. Springer, (2019)Relative Similarity Logics are Decidable: Reduction to FO2 with Equality., и . JELIA, том 1489 из Lecture Notes in Computer Science, стр. 279-293. Springer, (1998)Counter Systems for Data Logics.. JELIA, том 6341 из Lecture Notes in Computer Science, стр. 10. Springer, (2010)Reasoning About Transfinite Sequences., и . ATVA, том 3707 из Lecture Notes in Computer Science, стр. 248-262. Springer, (2005)Prefixed Tableaux Systems for Modal Logics with Enriched Languages., и . IJCAI (1), стр. 190-195. Morgan Kaufmann, (1997)Using Connection Method in Modal Logics: Some Advantages.. TABLEAUX, том 918 из Lecture Notes in Computer Science, стр. 63-78. Springer, (1995)