Baaz, MatthiasFermüller, Christian G.Zach, Richard2021-05-032021-05-031994-01Baaz, M., Fermüller, C.G., & Zach, R. (1993) Elimination of Cuts in First-order Finite-valued Logics. J. Inf. Process. Cybern. 29(6): 333-3550013-5712http://hdl.handle.net/1880/113337A uniform construction for sequent calculi for finite-valued first-order logics with distribution quantifiers is exhibited. Completeness, cut-elimination and midsequent theorems are established. As an application, an analog of Herbrand’s theorem for the four-valued knowledge-representation logic of Belnap and Ginsberg is presented. It is indicated how this theorem can be used for reasoning about knowledge bases with incomplete and inconsistent information.engUnless otherwise indicated, this material is protected by copyright and has been made available with authorization from the copyright owner. You may use this material in any way that is permitted by the Copyright Act or through licensing that has been assigned to the document. For uses that are not allowable under copyright legislation or licensing, you are required to seek permission.many-valued logicsequent calculusBelnap logicjournal article10.11575/PRISM/38801