Completeness of first order logic

  • Richard Lassaigne
  • Michel de Rougemont
Part of the Discrete Mathematics and Theoretical Computer Science book series (DISCMATH)


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.


Order Logic Deduction System Successor Function Natural Deduction Sequent Calculus 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag London 2004

Authors and Affiliations

  • Richard Lassaigne
    • 1
  • Michel de Rougemont
    • 2
  1. 1.Maitre de ConferencesUniversity Paris VIIFrance
  2. 2.University Paris IIFrance

Personalised recommendations