A complete mechanization of (&ohgr;) -order type theory

  • Authors:
  • T. Pietrzykowski;D. C. Jensen

  • Affiliations:
  • -;-

  • Venue:
  • ACM '72 Proceedings of the ACM annual conference - Volume 1
  • Year:
  • 1972

Quantified Score

Hi-index 0.00

Visualization

Abstract

We present a complete unification algorithm for logic with the language of all finite types. In addition, we show how this procedure can be used with a generalized resolution principle which does not require expressions to be pre-Skolemized. Both of these steps are essential for an effective and complete mechanization of higher order logic.