[Paper Review] Yet another proof of Goedel's completeness theorem for first-order classical logic

Marco B. Caminati|ArXiv.org|Oct 11, 2009

Logic, Reasoning, and Knowledge4 references3 citations

TL;DR

This paper presents a streamlined Henkin-style proof of Gödel's completeness theorem for first-order classical logic using a minimal set of Gentzen-style sequent rules—excluding the cut rule and proof by cases—thereby demonstrating that the satisfiability theorem requires one fewer rule than the completeness theorem. The key contribution is a more economical proof system that reveals intuitionistic logic's motivations from a classical perspective via the missing rule ¬¬φ → φ.

ABSTRACT

A Henkin-style proof of completeness of first-order classical logic is given with respect to a very small set (notably missing cut rule) of Genzten deduction rules for intuitionistic sequents. Insisting on sparing on derivation rules, satisfiability theorem is seen to need weaker assumptions than completeness theorem, the missing request being exactly the rule ~ p --> p, which gives a hint of intuitionism's motivations from a classical point of view. A bare treatment of standard, basic first-order syntax somehow more algebraic-flavoured than usual is also given.

Motivation & Objective

• To provide a new, streamlined proof of Gödel’s completeness theorem for first-order classical logic using a minimal set of derivation rules.
• To show that the satisfiability theorem, a key component of completeness proofs, requires fewer rules than the completeness theorem itself.
• To reformulate first-order syntax and semantics in a more algebraic, semigroup-based framework to simplify definitions and proofs.
• To clarify the logical distinction between classical and intuitionistic logic by isolating the rule ¬¬φ → φ as the critical difference.

Proposed method

• The proof uses a minimal set of 10 Gentzen-style sequent rules, omitting the cut rule and proof by cases, to derive the completeness theorem.
• A Henkin-style construction is applied to a consistent set of formulas, using a free interpretation and quotient construction to build a model.
• The paper introduces a semigroup-based formalization of first-order syntax and semantics, treating terms and formulas recursively via interpretation functions.
• Satisfiability is established via a model construction that relies on consistent sets closed under the given rules, with truth defined recursively over subformulas.
• The interpretation function ω is extended to terms and formulas, assigning values in a structure A, with satisfaction defined via truth evaluation over assignments.
• The key insight is that the rule ¬¬φ → φ is not needed for satisfiability, but is required for completeness, revealing a logical boundary between classical and intuitionistic reasoning.

Experimental results

Research questions

• RQ1 Can Gödel’s completeness theorem be proven using a smaller set of derivation rules than traditionally assumed, particularly without the cut rule?
• RQ2 What is the minimal set of rules required to prove the satisfiability of a consistent set of first-order formulas?
• RQ3 How does the absence of the rule ¬¬φ → φ in the derivation system affect the provability of completeness versus satisfiability?
• RQ4 To what extent can first-order logic syntax and semantics be reformulated in an algebraic, semigroup-based framework without losing expressiveness?
• RQ5 What does the difference in rule requirements between satisfiability and completeness reveal about the logical foundations of classical versus intuitionistic logic?

Key findings

• The satisfiability theorem can be proven using one fewer rule than the completeness theorem, specifically without requiring the rule ¬¬φ → φ.
• The completeness theorem is provable from a minimal set of 10 Gentzen-style rules, excluding the cut rule and proof by cases, with the latter being derivable from the former.
• The rule ¬¬φ → φ is identified as the precise logical difference that separates classical logic from intuitionistic logic, providing a formal justification for intuitionism’s foundational motivations.
• A new, more algebraic treatment of first-order syntax and semantics is developed, using semigroups and recursive interpretation functions, which simplifies definitions and proofs.
• The model construction for a consistent set of formulas is generalized to a free interpretation and quotient construction, enhancing the generality of Henkin’s method.
• The correctness of the derivation rules is established via a consistency theorem: any satisfiable set of formulas is consistent, regardless of the specific rule set used.