Banishing the rule of substitution for functional variables

@article{Henkin1953BanishingTR,
  title={Banishing the rule of substitution for functional variables},
  author={Leon Henkin},
  journal={Journal of Symbolic Logic},
  year={1953},
  volume={18},
  pages={201 - 208}
}
  • L. Henkin
  • Published 1 September 1953
  • Mathematics
  • Journal of Symbolic Logic
Let and be (well-formed) formulas of the functional calculus, let c be an n-adic functional variable, and let a1, …, an be distinct individual variables. Church has defined the metalogical notation to indicate the formula resulting from when each part of of the form c{1, …, n) (such that the occurrence of c is free in ) is replaced by the formula which arises from by replacing every free occurrence of ai by i, i, = 1, …, n. (Here 1, …, n may be any individual variables or constants, not… 

Substitution and Propositional Proof Complexity

  • S. Buss
  • Philosophy
    Outstanding Contributions to Logic
  • 2021
We discuss substitution rules that allow the substitution of formulas for formula variables. A substitution rule was first introduced by Frege. More recently, substitution is studied in the setting

Defining general structures

It will be proved that every general structure must be "closed" with respect to a family of Projectiυe operations, cf.

Truth-Value Semantics for the Theory of Types

Godel showed in 1931 that the valid wffs of T, the simple theory of types, outrun the theorems of T, and in fact cannot but outrun them. It was to be almost two decades before Henkin supplied a

A Complete Uniform Substitution Calculus for Differential Dynamic Logic

  • A. Platzer
  • Computer Science
    Journal of Automated Reasoning
  • 2016
This article introduces a relatively complete proof calculus for differential dynamic logic (dL) that is entirely based on uniform substitution, a proof rule that substitutes a formula for a

A Uniform Substitution Calculus for Differential Dynamic Logic

This paper introduces a new proof calculus for differential dynamic logic (dL) that is entirely based on uniform substitution, a proof rule that substitutes a formula for a predicate symbol

Systems between First-Order and Second-Order Logics

The most common logical system taught, used, and studied today is Elementary predicate logic, otherwise known as first-order logic (see Hodges’ chapter in this Volume). First-order logic has a

The Semantics of Entailment.

Once upon a time, modal logics “had no semantics”. Bearing a real world G, a set of worlds K, and a relation R of relative possibility between worlds, Saul Kripke beheld this situation and saw that

New directions in mechanical theorem proving

If the higher-order notion of logical validity is construed, following Henkin.

The semantics of entailment — III

Publisher Summary This chapter discusses the semantics of entailment. Earlier, modal logics had no semantics. Bearing a real world G, a set of worlds K, and a relation R of relative possibility

References

SHOWING 1-2 OF 2 REFERENCES

Completeness in the theory of types

  • L. Henkin
  • Mathematics
    Journal of Symbolic Logic
  • 1950
This proof demonstrates that each formula of the calculus is a formal theorem which becomes a true sentence under every one of a certain intended class of interpretations of the formal system.

Der Wahrheitsbegriff in formalisierten Sprachen

  • Studia philosophica, vol. I (1936), pp. 261-405. UNIVERSITY OF SOUTHERN CALIFORNIA 18
  • 1952