Classical Type Theory
- 1 January 2001
- book chapter
- Published by Elsevier
Abstract
No abstract availableThis publication has 33 references indexed in Scilit:
- The undecidability of the second-order unification problemTheoretical Computer Science, 1981
- Mechanizing ω-order type theory through unificationTheoretical Computer Science, 1976
- Resolution and the consistency of analysis.Notre Dame Journal of Formal Logic, 1974
- A Complete Mechanization of Second-Order Type TheoryJournal of the ACM, 1973
- Resolution in type theoryThe Journal of Symbolic Logic, 1971
- A proof of cut-elimination theorem in simple type-theoryJournal of the Mathematical Society of Japan, 1967
- A supplement to HerbrandThe Journal of Symbolic Logic, 1966
- Systems of predicative analysisThe Journal of Symbolic Logic, 1964
- False lemmas in HerbrandBulletin of the American Mathematical Society, 1963
- Completeness in the theory of typesThe Journal of Symbolic Logic, 1950