( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Formalized Meta-Theory of Sequent Calculi for Substructural Logics.

, , и . LSFA, том 332 из Electronic Notes in Theoretical Computer Science, стр. 57-73. Elsevier, (2016)

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.

Giselle Cheung

Giselle Sarganas

Giselle Schock-Skasa

Giselle Camargos Becker

Giselle Tamayo-Castillo

 

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

Towards CERes in intuitionistic logic., , и . CSL, том 16 из LIPIcs, стр. 485-499. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2012)Formalized Meta-Theory of Sequent Calculi for Substructural Logics., , и . LSFA, том 332 из Electronic Notes in Theoretical Computer Science, стр. 57-73. Elsevier, (2016)Preface., и . LSFA, том 351 из Electronic Notes in Theoretical Computer Science, стр. 1-2. Elsevier, (2020)System Description: GAPT 2.0., , , , , и . IJCAR, том 9706 из Lecture Notes in Computer Science, стр. 293-301. Springer, (2016)Quati: An Automated Tool for Proving Permutation Lemmas., , и . IJCAR, том 8562 из Lecture Notes in Computer Science, стр. 255-261. Springer, (2014)Introducing Quantified Cuts in Logic with Equality., , , , и . IJCAR, том 8562 из Lecture Notes in Computer Science, стр. 240-254. Springer, (2014)Specifying Proof Systems in Linear Logic with Subexponentials., , и . LSFA, том 269 из Electronic Notes in Theoretical Computer Science, стр. 109-123. Elsevier, (2010)Formalization of Automated Trading Systems in a Concurrent Linear Framework., , , и . Linearity-TLLA@FLoC, том 292 из EPTCS, стр. 1-14. (2018)Complexity of translations from resolution to sequent calculus., и . Math. Struct. Comput. Sci., 29 (8): 1061-1091 (2019)Proof Search and Certificates for Evidential Transactions., , , и . CADE, том 12699 из Lecture Notes in Computer Science, стр. 234-251. Springer, (2021)