Accession Number : ADA256233


Title :   On Statman's Finite Completeness Theorem


Corporate Author : CARNEGIE-MELLON UNIV PITTSBURGH PA SCHOOL OF COMPUTER SCIENCE


Personal Author(s) : Statman, Richard ; Dowek, Gilles


Full Text : https://apps.dtic.mil/dtic/tr/fulltext/u2/a256233.pdf


Report Date : Jun 1992


Pagination or Media Count : 19


Abstract : We give a complete self-contained proof of Statman's finite completeness theorem and of a corollary of this theorem stating that the Lambda- definability conjecture implies the higher-order matching conjecture.


Descriptors :   *CALCULUS , SELF CONTAINED , MATCHING


Subject Categories : Numerical Mathematics


Distribution Statement : APPROVED FOR PUBLIC RELEASE