Henkin's Completeness Proof: Forty Years Later

@article{Leblanc1991HenkinsCP,
  title={Henkin's Completeness Proof: Forty Years Later},
  author={Hugues Leblanc and Peter Roeper and Michael Thau and George Weaver},
  journal={Notre Dame J. Formal Log.},
  year={1991},
  volume={32},
  pages={212-232}
}
1 In his 1949 paper, "The completeness of the first-order calculus", Henkin developed what is now called the method of (individual) terms to establish that every consistent set of statements of a first-order language L has a model of cardinality α, a the number of statements of L. The idea is to start with such a set S, construct a so-called term-extension L of L by adding a new terms to the vocabulary of L, extend 5 to a maximally consistent and term-complete set Soo of statements of L, and… 
Initial segments and end-extensions of models of arithmetic
This thesis is organized into two independent parts. In the first part, we extend the recent work on generic cuts by Kaye and the author. The focus here is the properties of the pairs (M, I) where I
What are Absolute Probabilities a Function of
Truth-value semantics was born twice on the same day, at a conference on Free Logic held at Michigan State University in June of 1967. On that day J. Michael Dunn and I read consecutive papers, each
Adding standardness to nonstandard arithmetic
We discuss structures (M;!) where M is a nonstandard model of PA and ! is a unary predicate for the standard cut. For a given theory T of a cut in a model of PA, we give a Henkin{Orey style
Lambek–Grishin Calculus Extended to Connectives of Arbitrary Arity
TLDR
A cut-free presentation of the Lambek–Grishin calculus for n-ary connectives is showed, proving the decidability of the calculus and the symmetries are investigated by making use of group theory.
The omega-rule
  • M. Thau
  • Mathematics, Philosophy
    Stud Logica
  • 1992
We prove that all proofs in ω-logic (a first order logic with ω-rule added) in which ω-rule is used finitely many times can be turned into proofs in which the ω-rule is used at most one time. Next,
A Strongly-Local Contextual Logic
TLDR
A deductive system of contextual inference and a possible-worlds based semantics is given, with formal results including soundness and completeness, and a number of properties are examined.

References

SHOWING 1-10 OF 28 REFERENCES
The Completeness of the First-Order Functional Calculus
TLDR
This paper presents a new method of proof for the first-order functional calculus which requires less formal development of the system from the axioms and suggests a new approach to the problem of completeness for functional calculi of higher order.
What are Absolute Probabilities a Function of
Truth-value semantics was born twice on the same day, at a conference on Free Logic held at Michigan State University in June of 1967. On that day J. Michael Dunn and I read consecutive papers, each
The substitution interpretation of the quantifiers
I The basic formal ideas of this interpretation were in a certain sense anticipated by E. W. Beth with his "reduced logic" in [3]. We are grateful to Professor Bas C. van Fraassen for bringing this
Alternatives to Standard First-Order Semantics
TLDR
Alternatives to standard semantics are legion, some even antedating standard semantics, among them: substitutional semantics, truth-value semantics, and probabilistic semantics, which are to be studied here.
Truth-Value Semantics
A Generalization of the Concept of |omega-Consistency
  • L. Henkin
  • Mathematics, Computer Science
    J. Symb. Log.
  • 1954
...
...