( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Automated Theorem Proving for Metamath.

, , и . ITP, том 268 из LIPIcs, стр. 9:1-9:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)

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.

Chad Davis

Adrian Chadi

Lore Chadmand

Lore Chadmand

Marcin Chady

 

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

Verifying and Invalidating Textbook Proofs Using Scunak.. MKM, том 4108 из Lecture Notes in Computer Science, стр. 110-123. Springer, (2006)Internal Guidance for Satallax., и . IJCAR, том 9706 из Lecture Notes in Computer Science, стр. 349-361. Springer, (2016)Exploration of Neural Machine Translation in Autoformalization of Mathematics in Mizar., , , и . CoRR, (2019)Symbolic Computation for All the Fun., , и . CoRR, (2024)Higher-Order Tarski Grothendieck as a Foundation for Formal Proof., , и . ITP, том 141 из LIPIcs, стр. 9:1-9:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Reasoning in Extensional Type Theory with Equality.. CADE, том 3632 из Lecture Notes in Computer Science, стр. 23-37. Springer, (2005)Automated Theorem Proving for Metamath., , и . ITP, том 268 из LIPIcs, стр. 9:1-9:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Encoding Functional Relations in Scunak.. LFMTP@FLoC, том 174 из Electronic Notes in Theoretical Computer Science, стр. 127-139. Elsevier, (2006)Abstract: Challenges and Solutions for Higher-Order SMT Proofs., , и . SMT, том 3185 из CEUR Workshop Proceedings, стр. 128. CEUR-WS.org, (2022)Translating SUMO-K to Higher-Order Set Theory., , и . FroCoS, том 14279 из Lecture Notes in Computer Science, стр. 255-274. Springer, (2023)