Abstract
A uniform construction for sequent calculi for finite-valued first-order logics with dis- tribution 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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have