[Paper Review] Lectures on Jacques Herbrand as a Logician

Claus-Peter Wirth, Jörg H. Siekmann+2 more|arXiv (Cornell University)|Feb 26, 2009

Logic, programming, and type systems61 references3 citations

TL;DR

This paper provides a comprehensive scholarly analysis of Jacques Herbrand's contributions to formal logic, focusing on his foundational work in proof theory, consistency proofs, recursive functions, and unification. It corrects historical misconceptions—such as Herbrand's 'False Lemma' and Modus Ponens Elimination—using unpublished corrections by Heijenoort and presents the original text of Herbrand's unification algorithm, establishing his lasting influence on automated theorem proving and computer science.

ABSTRACT

We give some lectures on the work on formal logic of Jacques Herbrand, and sketch his life and his influence on automated theorem proving. The intended audience ranges from students interested in logic over historians to logicians. Besides the well-known correction of Herbrand's False Lemma by Goedel and Dreben, we also present the hardly known unpublished correction of Heijenoort and its consequences on Herbrand's Modus Ponens Elimination. Besides Herbrand's Fundamental Theorem and its relation to the Loewenheim-Skolem-Theorem, we carefully investigate Herbrand's notion of intuitionism in connection with his notion of falsehood in an infinite domain. We sketch Herbrand's two proofs of the consistency of arithmetic and his notion of a recursive function, and last but not least, present the correct original text of his unification algorithm with a new translation.

Motivation & Objective

• To re-express and clarify Herbrand's seminal contributions to formal logic, particularly in proof theory and consistency of arithmetic.
• To correct long-standing misconceptions about Herbrand's work, including the 'False Lemma' and Modus Ponens Elimination, using unpublished corrections by Heijenoort.
• To recover and present the original text of Herbrand's unification algorithm, previously obscured or misattributed.
• To demonstrate the enduring impact of Herbrand's work on modern automated theorem proving and artificial intelligence.
• To provide a historically accurate and technically rigorous account of Herbrand's logical insights for researchers in logic, history of mathematics, and computer science.

Proposed method

• Analyzes Herbrand's original manuscripts and unpublished notes, particularly focusing on his 1930 work on consistency and unification.
• Reconstructs and translates Herbrand's original unification algorithm from French to English, correcting prior misinterpretations.
• Applies historical and logical analysis to resolve disputes around Herbrand's 'False Lemma' and its correction by Gödel and Dreben.
• Re-evaluates Herbrand's Modus Ponens Elimination using Heijenoort's unpublished correction, clarifying its role in proof theory.
• Compares Herbrand's notion of intuitionism and falsehood in infinite domains with later developments in model theory and constructive logic.
• Reconstructs and validates Herbrand's two proofs of the consistency of arithmetic, emphasizing their finitistic and contentual foundations.

Experimental results

Research questions

• RQ1 How did Herbrand's work on consistency proofs in arithmetic anticipate later developments in proof theory?
• RQ2 What is the true nature and historical significance of Herbrand's 'False Lemma', and how was it corrected by Gödel and Dreben?
• RQ3 What is the role of Heijenoort's unpublished correction in clarifying Herbrand's Modus Ponens Elimination?
• RQ4 How does Herbrand's notion of intuitionism relate to his conception of falsehood in infinite domains?
• RQ5 What is the original formulation and significance of Herbrand's unification algorithm in the context of automated theorem proving?

Key findings

• Herbrand's 'False Lemma' was corrected by Gödel and Dreben, but a deeper, unpublished correction by Heijenoort reveals a more nuanced understanding of Modus Ponens Elimination in Herbrand's system.
• Herbrand's original unification algorithm, reconstructed and translated here, predates and predetermines modern unification in logic programming and automated deduction.
• Herbrand's two proofs of the consistency of arithmetic are shown to be based on finitistic, contentual reasoning, aligning with Hilbert's program and anticipating modern proof-theoretic methods.
• Herbrand's notion of intuitionism is not classical intuitionism but a form of contentual, constructive reasoning grounded in finite symbolic structures.
• The paper establishes that Herbrand's Fundamental Theorem is deeply connected to the Löwenheim–Skolem Theorem, particularly in the context of Herbrand disjunctions and Skolem normal forms.
• The paper corrects and extends Herbrand's bibliography and references, providing a definitive scholarly resource on his logical legacy.