On Statman's Finite Completeness Theorem
CARNEGIE-MELLON UNIV PITTSBURGH PA SCHOOL OF COMPUTER SCIENCE
Pagination or Media Count:
We give a complete self-contained proof of Statmans finite completeness theorem and of a corollary of this theorem stating that the Lambda- definability conjecture implies the higher-order matching conjecture.
- Numerical Mathematics