Abstract
The deduction system we will use to show the completeness of first order logic is an extension of the natural deduction systems, presented for propositional logic. There are essentially two other sorts of formal system for mathematical reasoning. Historically, the first one was Hilbert’s system, based on axiom schemes and deduction rules. The second one, due to G. Gentzen, is the sequent calculus which has the advantage of using symmetric deduction rules.
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
© 2004 Springer-Verlag London
About this chapter
Cite this chapter
Lassaigne, R., de Rougemont, M. (2004). Completeness of first order logic. In: Logic and Complexity. Discrete Mathematics and Theoretical Computer Science. Springer, London. https://doi.org/10.1007/978-0-85729-392-3_5
Download citation
DOI: https://doi.org/10.1007/978-0-85729-392-3_5
Publisher Name: Springer, London
Print ISBN: 978-1-4471-1052-1
Online ISBN: 978-0-85729-392-3
eBook Packages: Springer Book Archive