Abstract
This chapter provides an overview the many-sorted version of calculus and the proof theoretic part of the Sort- Theorem. It presents a many-sorted version of a Hilbert-type calculus without function symbols and subsorts. The chapter presents a proof of soundness and completeness of the calculus and the model theoretic part of the Sort-Theorem. An alternative proof of the proof theoretic part of the Sort-Theorem is provided by an application of the Herbrand theorem. This proof was inadequate. The chapter presents a proof of a theorem that corresponds to the proof theoretic part of the Sort-Theorem.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: A Many-Sorted Calculus Based on Resolution and Paramodulation
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
