An intensional type theory: Motivation and cut-elimination

Journal of Symbolic Logic

Volumn 66, Issue 1, 2001, Pages 383-400

  Gilmore, Paul C ^a  

^a UNIVERSITY OF BRITISH COLUMBIA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0035630909     PISSN: 00224812     EISSN: None     Source Type: Journal    
DOI: 10.2307/2694928     Document Type: Article

References (32)

1. PETER B. ANDREWS, SUNIL ISSAR, DANIEL NESMITH, and FRANK PFENNING, The tps theorem proving system, 9'th international conference on automated deduction (cade) (E. Lusk and R. Overbeek, editors), Lecture Notes in Computer Science, vol. 310, Springer-Verlag, 1988, pp. 760-761.
2. H. P. BARENDREGT, The lambda calculus, its syntax and semantics, North-Holland, 1985, Revised Edition.
3. JON BARWISE and LAWRENCE MOSS, Vicious circles, CSLI Publications, 1996.
4. E. W. BETH, Semantic entailment and formal derivability, N. V. Noord-Hollandsche Uitgevers Maatschappij, Amsterdam, 1955.
5. RUDOLPH CARNAP, Meaning and necessity, University of Chicago Press, 1947.
6. ALONZO CHURCH, Schröder's anticipation of the simple theory of types, The Journal of Unified Science (Erkenntnis), vol. 9 (1939), pp. 149-152.
7. _, A formulation of the simple theory of types, this JOURNAL, vol. 5 (1940), pp. 56-68.
8. B. COCCHIARELLA, Conceptual realism versus quine on classes and higher-order logic, Synthese, vol. 90 (1992), pp. 379-436.
9. NINO B. COCCHIARELLA, Logical investigations of predication and the problem of universals, Bibliopolis Press, Naples, 1986.
10. WILLIAM M. FARMER, A partial functions version of church's simple theory of types, this JOURNAL, vol. 55 (1990), pp. 1269-1290.
11. M. C. FITTING, First-order logic and automated theorem proving, Springer-Verlag, 1996, Second Edition.
12. PAUL C. GILMORE, An intensional type theory: Logical foundations for mathematics and computer science, a monograph on ITT in preparation.
13. _, A consistent naive set theory: Foundations for a formal theory of computation, Technical Report Research Report RC 3413, IBM, June 1971.
14. _, Combining unrestricted abstraction with universal quantification, To h.b. curry: Essays on combinatorial logic, lambda calculus and formalism (J. P. Seldin and J. R. Hindley, editors), Academic Press, 1980, This is a revised version of [13], pp. 99-123.
15. _, Natural deduction based set theories: A new resolution of the old paradoxes, this JOURNAL, vol. 51 (1986), pp. 393-411.
16. _, A foundation for the entity relationship approach: How and why, Proceedings of the 6th entity relationship conference (S.T. March, editor), North-Holland, 1988, pp. 95-113.
17. _, Nadsyl and some applications, Computational logic and proof theory, the kurt Gödel colloquium 97 (Georg Gottlob, Alexander Leitsch, and Daniele Mundici, editors), Lecture Notes in Computer Science, vol. 1289, Springer-Verlag, 1997, pp. 153-166.
18. _, An impredicative simple theory of types, May 1998, presented at the Fourteenth Workshop on Mathematical Foundations for Programming Systems, Queen Mary College, London.
19. MICHAEL J. C. GORDON, A proof generating system for higher-order logic, Vlsi specification, verification and synthesis (G. Birtwistle and P. Subrahmanyam, editors), Academic Publishers, Boston, 1987, Also, University of Cambridge Computer Laboratory Technical Report No. 103, pp. 73-128.
20. _, Set theory, higher order logic or both?, higher order logic theorem proving and its applications, (Joakum von Wright, Jim Grundy, and John Harrison, editors), Lecture Notes in Computer Science, vol. 1125, Springer-Verlag, 1996, pp. 191-202.
21. LEON HENKIN, Completeness in the theory of types, this JOURNAL, vol. 15 (1953), pp. 81-91.
22. GOPALAN NADATHUR and DALE MILLER, Higher-order logic programming, Handbook of logic in artificial intelligence and logic programming (C.J. Hogger Dov M. Gabbay and J.A. Robinson, editors), Clarendon Press, Oxford, 1998, pp. 499-590.
23. MOTO O TAKAHASHI, A proof of cut-elimination theorem in simple type-theory, Journal of the Mathematical Society of Japan, vol. 19 (1967), pp. 399-410.
24. S. OWRE, N. SHANKAR, and J. M. RUSHBY, The pvs specification language, June 1993, (beta release).
25. DAG PRAWTTZ, Hauptsatz for higher order logic, this JOURNAL, vol. 33 (1968), pp. 452-457.
26. BERTRAND RUSSELL, The principles of mathematics, George Allen and Unwin Ltd, London, 1937, second edition.
27. K. SCHÜTTE, Syntactical and semantical properties of simple type theory, this JOURNAL, vol. 25 (1960), pp. 305-326.
28. WILFRED SELLARS, Abstract entities, Review of Metaphysics, vol. 16 (1963), pp. 625-671.
29. _, Classes as abstract entities and the russell paradox, Review of Metaphysics, vol. 17 (1963), pp. 67-90.
30. JOSEPH R. SHOENFIELD, Mathematical logic, Addison-Wesley, 1967.
31. R. M. SMULLYAN, First-order logic, Springer-Verlag, Berlin, 1994, Revised Edition, Dover Press, New York.
32. ERNST ZERMELO, Investigations in the foundations of set theory, From frege to Gödel (Jean van Heijenoort, editor), Harvard University Press, 1967, pp. 199-215.