References
Baaz, M., A. Ciabattoni, and C. G. Fermüller, First order Gödel logics by hyperclause resolution, in Proc. Logic for Programming, Artificial Intelligence and Reasoning (LPAR 2008), Lecture Notes in Artificial Intelligence 5330, Springer-Verlag, 2008, pp. 451–466.
Baaz M., Leitsch A.: Cut-elimination and redundancy-elimination by resolution. Journal of Symbolic Computation 29, 149–176 (2000)
Baaz, M., and A. Leitsch, CERES in many-valued logics, in Proc. Logic for Programming, Artificial Intelligence and Reasoning (LPAR 2004), Lecture Notes in Artificial Intelligence 3452, Springer-Verlag, 2005, pp. 1–20.
Dunchev, C., A. Leitsch, T. Libal, M. Reiner, M. Rukhaia, D. Weller, and B. Woltzenlogel-Paleo, ProofTool: A GUI for the GAPT framework, in Proc. 10th Workshop on User Interfaces for Theorem Provers (UITP 2012), Electronic Proceedings in Theoretical Computer Science 118, 2012, pp. 1–14.
Paterson M.S., Wegman M.N.: Linear unification. J. Comput. System Sci. 16, 158–167 (1978)
Statman R.: Lower bounds on Herbrand’s theorem. Proceedings of the American Mathematical Society 75, 104–107 (1979)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Buss, S. Book Review: Matthias Baaz and Alexander Leitsch, Methods of Cut-Elimination. Stud Logica 103, 663–667 (2015). https://doi.org/10.1007/s11225-015-9618-z
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11225-015-9618-z