( en | de | ru )

 

Disambiguation of "Leitsch, Alexander"

Author of the publication

copydeleteadd this publication to your clipboard
Cut-Elimination: Experiments with CERES.

, , , , and . LPAR, volume 3452 of Lecture Notes in Computer Science, page 481-495. Springer, (2004)

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.

Wilhelm Leitsch

Carola Leitsch

Tobias Leitsch

Joachim Leitsch

Dominik Leitsch

 

Other publications of authors with the same name

Cut-Elimination: Experiments with CERES., , , , and . LPAR, volume 3452 of Lecture Notes in Computer Science, page 481-495. Springer, (2004)Towards CERes in intuitionistic logic., , and . CSL, volume 16 of LIPIcs, page 485-499. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2012)System Feature Description: Importing Refutations into the GAPT Framework., , , , , , and . PxTP, volume 878 of CEUR Workshop Proceedings, page 51-57. CEUR-WS.org, (2012)Herbrand's Theorem in Inductive Proofs., and . LPAR, volume 100 of EPiC Series in Computing, page 295-310. EasyChair, (2024)CERES in Many-Valued Logics., and . LPAR, volume 3452 of Lecture Notes in Computer Science, page 1-20. Springer, (2004)Transforming and Analyzing Proofs in the CERES-System., , , and . LPAR Workshops, volume 418 of CEUR Workshop Proceedings, CEUR-WS.org, (2008)Decision Procedures and Model Building, or How to Improve Logical Information in Automated Deduction.. FTP (LNCS Selection), volume 1761 of Lecture Notes in Computer Science, page 62-79. Springer, (1998)Herbrand Sequent Extraction., , , and . AISC/MKM/Calculemus, volume 5144 of Lecture Notes in Computer Science, page 462-477. Springer, (2008)Incompleteness of a First-Order Gödel Logic and Some Temporal Logics of Programs., , and . CSL, volume 1092 of Lecture Notes in Computer Science, page 1-15. Springer, (1995)A Note on the Complexity of Classical and Intuitionistic Proofs., , and . LICS, page 657-666. IEEE Computer Society, (2015)