The completeness of the first-order functional calculus

@article{Henkin1949TheCO,
  title={The completeness of the first-order functional calculus},
  author={Leon Henkin},
  journal={Journal of Symbolic Logic},
  year={1949},
  volume={14},
  pages={159 - 166}
}
  • L. Henkin
  • Published 1 September 1949
  • Mathematics
  • Journal of Symbolic Logic
Although several proofs have been published showing the completeness of the propositional calculus (cf. Quine (1)), for the first-order functional calculus only the original completeness proof of Gödel (2) and a variant due to Hilbert and Bernays have appeared. Aside from novelty and the fact that it requires less formal development of the system from the axioms, the new method of proof which is the subject of this paper possesses two advantages. In the first place an important property of… 

On the scope of the completeness theorem for first-order predicate logic

The problem of completeness of classical first-order predicate logic was formulated, for the first time in precise mathematical terms, in 1928 by Hilbert and Ackermann in [16] and solved positively

Completeness: from Gödel to Henkin

This paper focuses on the evolution of the notion of completeness in contemporary logic. We discuss the differences between the notions of completeness of a theory, the completeness of a calculus,

Formal topologies on the set of first-order formulae

The completeness proof for first-order logic by Rasiowa and Sikorski [13] is a simplification of Henkin's proof [7] in that it avoids the addition of infinitely many new individual constants. Instead

A HENKIN-STYLE PROOF OF COMPLETENESS FOR FIRST-ORDER ALGEBRAIZABLE LOGICS

Henkin’s proof of completeness of classical first-order logic is considered and its scope is extended to the realm of algebraizable logics in the sense of Blok and Pigozzi and obtained a form of Skolemization.

Henkin's Completeness Proof: Forty Years Later

Two new completeness proofs for first-order Z are offered here, one of them minding the consistent sets of statements of L that extend without new terms, and the other relating to truth-value semantics, denumerably many.

On the strong semantical completeness of the intuitionistic predicate calculus

  • R. Thomason
  • Mathematics, Philosophy
    Journal of Symbolic Logic
  • 1968
The object of the present paper is to extend Kripke's result to obtain a strong completeness theorem for the intuitionistic predicate calculus of first order, and show that a formula A of this calculus can be deduced from a set r of formulas if and only if r implies A.

Model theory for the higher order predicate calculus

The theory of models for elementary (often called "first order") axiom systems has grown considerably in the last years. This theory has been developed both for its own interest and as a tool for

The Compactness Theorem

The compactness theorem is a fundamental theorem for the model theory of (classical) propositional and first-order logic. As well as having importance in several areas of mathematics, such as algebra

Constructive Completeness Proofs and Delimited Control

Motivated by facilitating reasoning with logical meta-theory inside the Coq proof assistant, we investigate the constructive versions of some completeness theorems. We start by analysing the proofs
...

References

SHOWING 1-5 OF 5 REFERENCES

Completeness of the propositional calculus

  • W. Quine
  • Mathematics, Philosophy
    Journal of Symbolic Logic
  • 1938
The completeness of the prepositional calculus was first proved by Post. His somewhat condensed proof has been succeeded by more detailed presentations of substantially the same argument, and also by

Die Vollständigkeit der Axiome des logischen Funktionenkalküls

Jakina da Whiteheadek eta Russellek logika eta matematika eraiki dutela ageriko zenbait proposizio axiomatzat hartuz, eta horietatik, zehatz azaldutako inferentzia printzipioetan oinarrituz, logikako