A Set Theory with Support for Partial Functions

Studia Logica

Volumn 66, Issue 1, 2000, Pages 59-78

  Farmer, William M ^a,b   Guttman, Joshua D ^a  

^a MCMASTER UNIVERSITY   (Canada)

^b MITRE CORPORATION   (United States)

Author keywords

Mechanized mathematics; NBG; Partial functions; Set theory; Sorts; Theorem proving systems; Undefinedness

Indexed keywords

EID: 0343706445     PISSN: 00393215     EISSN: 15728730     Source Type: Journal    
DOI: 10.1023/A:1026744827863     Document Type: Article

References (29)

1. BEESON, M., 'Formalizing constructive mathematics: why and how?', in F. Richman (ed.), Constructive Mathematics: Proceedings, New Mexico, 1980, volume 873 of Lecture Notes in Mathematics, pages 146-190, Springer-Verlag, 1981.
2. BEESON, M. J., Foundations of Constructive Mathematics, Springer-Verlag, Berlin, 1985.
3. BÜRGE, T., Truth and Some Referential Devices, PhD thesis, Princeton University, 1971.
4. BURGE, T., 'Truth and singular terms', in K. Lambert (ed.), Philosophical Applications of Free Logic, pages 189-204, Oxford University Press, 1991.
5. CRAIGEN, D., S. KROMODIMOELJO, I. MEISELS, B. PASE, and M. SAALTINK, 'EVES: an overview', Technical Report CP-91-5402-43, ORA Corporation, 1991.
6. FARMER, W. M., 'A partial functions version of Church's simple theory of types', Journal of Symbolic Logic 55 (1990): 1269-1291.
7. FARMER, W. M., 'A simple type theory with partial functions and subtypes', Annals of Pure and Applied Logic 64 (1993): 211-240.
8. FARMER, W. M., 'Theory interpretation in simple type theory', in J. Heering et al. (ed.), Higher-Order Algebra, Logic, and Term Rewriting, volume 816 of Lecture Notes in Computer Science, pages 96-123, Springer-Verlag, 1994.
9. FARMER, W. M., 'Reasoning about partial functions with the aid of a computer', Erkenntnis 43 (1995) :279-294.
10. FARMER, W. M., 'STMM: a set theory for mechanized mathematics', Journal of Automated Reasoning, forthcoming.
11. FARMER, W. M., J. D. GUTTMAN, and F. J. THAYER, 'IMPS: an interactive mathematical proof system', Journal of Automated Reasoning 11 (1993): 213-248.
12. FARMER, W. M., J. D. GUTTMAN, and F. J. THAYER FáBREGA, 'IMPS: an updated system description', in M. McRobbie and J. Slaney (eds.), Automated Deduction - CADE-13, volume 1104 of Lecture Notes in Computer Science, pages 298-302, Springer-Verlag, 1996.
13. FEFERMAN, S., 'Definedness', Erkenntnis 43 (1995): 295-320.
14. GÖDEL, K., The Consistency of the Axiom of Choice and the Generalized Continuum Hypothesis with the Axioms of Set Theory, volume 3 of Annals of Mathematical Studies, Princeton University Press, 1940.
15. GORDON, M., 'Set theory, higher order logic or both?', in J. Grundy and J. Harrison (eds.), Theorem Proving in Higher Order Logic: 9th International Conference, TPHOLs'96, volume 1125 of Lecture Notes in Computer Science, pages 191-202, Springer-Verlag, 1996.
16. KUNEN, K., Set Theory: An Introduction to Independence Proofs, North-Holland, 1980.
17. McCUNE, W., 'OTTER 2.0', in M. E. Stickel (ed.), 10th International Conference on Automated Deduction, volume 449 of Lecture Notes in Computer Science, pages 663664, Springer-Verlag, 1990.
18. MEGILL, N.D., Metamath: A Computer Language for Pure Mathematics, 1997. Available at http://www.shore.net/~ndm/java/nnn.html.
19. MENDELSON, E., Introduction to Mathematical Logic, Van Nostrand, 1964.
20. MONK, L. G., 'PDLM: a proof development language for mathematics', Technical Report M86-37, The MITRE Corporation, Bedford, Massachusetts, 1986.
21. MONTAGUE, R., 'Semantic closure and non-finite axiomatizability', in Infinitistic Methods, pages 45-69. Pergamon, 1961.
22. NlPKOW, T., and L. C. PAULSON, 'Isabelle-91', in D. Kapur (ed.), Automated Deduction - CADE-11, volume 607 of Lecture Notes in Computer Science, pages 673-676, Springer-Verlag, 1992.
23. NOVAK, I. L., 'A construction for models of consistent systems', Fundamenta Mathematicae 37 (1950): 87-110.
24. PAULSON, L. C., 'Set theory for verification: I. from foundations to functions'. Journal of Automated Reasoning 11 (1993): 353-389.
25. QuAIFE, A., 'Automated deduction in von Neumann-Bernays-Gödel set theory', Journal of Automated Reasoning 8 (1993): 91-147.
26. ROSSER, J. B., and H. WANG, 'Non-standard models for formal logics', Journal of Symbolic Logic, 15 (1950): 113-129.
27. RUDNICKI, P., 'An overview of the MIZAR project', Technical report, Department of Computing Science, University of Alberta, 1992.
28. SCHOCK, R., Logics without Existence Assumptions, Almqvist & Wiksells, Stockholm, Sweden, 1968.
29. SHOENFIELD, J., 'A relative consistency proof, Journal of Symbolic Logic, 19 (1954):21-28.