Abstract
In this chapter we show how to extend Hilbert system, natural deduction, Gentzen sequent, tableau, and resolution proof procedures from propositional to first-order logic. We begin with tableaux and resolution, in versions that are best suited to hand work. In the next chapter, we revise these to a form that is better for computer implementation. As we observed in Section 5.3, we can confine ourselves to proving sentences, since validity of arbitrary formulas can be reduced to that of sentences. We begin with a tableau system in this section, treating resolution in the next.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1996 Springer-Verlag New York, Inc.
About this chapter
Cite this chapter
Fitting, M. (1996). First-Order Proof Procedures. In: First-Order Logic and Automated Theorem Proving. Graduate Texts in Computer Science. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-2360-3_6
Download citation
DOI: https://doi.org/10.1007/978-1-4612-2360-3_6
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4612-7515-2
Online ISBN: 978-1-4612-2360-3
eBook Packages: Springer Book Archive