Skip to main content

Formalizing Undefinedness Arising in Calculus

  • Conference paper
Automated Reasoning (IJCAR 2004)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 3097))

Included in the following conference series:

Abstract

Undefined terms are commonplace in mathematics, particularly in calculus. The traditional approach to undefinedness in mathematical practice is to treat undefined terms as legitimate, nondenoting terms that can be components of meaningful statements. The traditional approach enables statements about partial functions and undefined terms to be stated very concisely. Unfortunately, the traditional approach cannot be easily employed in a standard logic in which all functions are total and all terms are defined, but it can be directly formalized in a standard logic if the logic is modified slightly to admit undefined terms and statements about definedness. This paper demonstrates this by defining a version of simple type theory called Simple Type Theory with Undefinedness (sttwu) and then formalizing in sttwu examples of undefinedness arising in calculus. The examples are taken from M. Spivak’s well-known textbook Calculus.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Andrews, P.B.: A reduction of the axioms for the theory of propositional types. Fundamenta Mathematicae 52, 345–350 (1963)

    MATH  MathSciNet  Google Scholar 

  2. Andrews, P.B.: An Introduction to Mathematical Logic and Type Theory: To Truth through Proof, 2nd edn. Kluwer, Dordrecht (2002)

    MATH  Google Scholar 

  3. Beeson, M.: Formalizing constructive mathematics: Why and how? In: Richman, F. (ed.) Proceedings of Constructive Mathematics: New Mexico, 1980. Lecture Notes in Mathematics, vol. 873, pp. 146–190. Springer, Heidelberg (1981)

    Chapter  Google Scholar 

  4. Beeson, M.J.: Foundations of Constructive Mathematics. Springer, Berlin (1985)

    MATH  Google Scholar 

  5. Burge, T.: Truth and Some Referential Devices. PhD thesis, Princeton University (1971)

    Google Scholar 

  6. Burge, T.: Truth and singular terms. In: Lambert, K. (ed.) Philosophical Applications of Free Logic, pp. 189–204. Oxford University Press, Oxford (1991)

    Google Scholar 

  7. Church, A.: A formulation of the simple theory of types. Journal of Symbolic Logic 5, 56–68 (1940)

    Article  MATH  MathSciNet  Google Scholar 

  8. Farmer, W.M.: A partial functions version of Church’s simple theory of types. Journal of Symbolic Logic 55, 1269–1291 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  9. Farmer, W.M.: A simple type theory with partial functions and subtypes. Annals of Pure and Applied Logic 64, 211–240 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  10. Farmer, W.M.: Theory interpretation in simple type theory. In: Heering, J., Meinke, K., Möller, B., Nipkow, T. (eds.) HOA 1993. LNCS, vol. 816, pp. 96–123. Springer, Heidelberg (1994)

    Google Scholar 

  11. Farmer, W.M.: Reasoning about partial functions with the aid of a computer. Erkenntnis 43, 279–294 (1995)

    Article  MathSciNet  Google Scholar 

  12. Farmer, W.M.: stmm: A set theory for mechanized mathematics. Journal of Automated Reasoning 26, 269–289 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  13. Farmer, W.M.: The seven virtues of simple type theory. SQRL Report No. 18, McMaster University (2003)

    Google Scholar 

  14. Farmer, W.M.: A sound and complete proof system for sttwu. Technical Report No. CAS-04-01-WF, McMaster University (2004)

    Google Scholar 

  15. Farmer, W.M., Guttman, J.D.: A set theory with support for partial functions. Studia Logica 66, 59–78 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  16. Farmer, W.M., Guttman, J.D., Thayer, F.J.: imps: An Interactive Mathematical Proof System. Journal of Automated Reasoning 11, 213–248 (1993)

    Article  MATH  Google Scholar 

  17. Farmer, W.M., Guttman, J.D., Thayer Fábrega, F.J.: imps: An updated system description. In: McRobbie, M.A., Slaney, J.K. (eds.) CADE 1996. LNCS, vol. 1104, pp. 298–302. Springer, Heidelberg (1996)

    Google Scholar 

  18. Feferman, S.: Polymorphic typed lambda-calculi in a type-free axiomatic framework. Contemporary Mathematics 106, 101–136 (1990)

    MathSciNet  Google Scholar 

  19. Kerber, M., Kohlhase, M.: A mechanization of strong Kleene logic for partial functions. In: Bundy, A. (ed.) CADE 1994. LNCS, vol. 814, pp. 371–385. Springer, Heidelberg (1994)

    Google Scholar 

  20. Monk, L.G.: pdlm: A Proof Development Language for Mathematics. Technical Report M86-37, The mitre Corporation, Bedford, Massachusetts (1986)

    Google Scholar 

  21. Müller, O., Slind, K.: Treating partiality in a logic of total functions. The Computer Journal 40, 640–652 (1997)

    Article  Google Scholar 

  22. Parnas, D.L.: Predicate logic for software engineering. IEEE Transactions on Software Engineering 19, 856–861 (1993)

    Article  Google Scholar 

  23. Schock, R.: Logics without Existence Assumptions. Almqvist & Wiksells, Stockholm (1968)

    MATH  Google Scholar 

  24. Spivak, M.: Calculus. W. A. Benjamin (1967)

    Google Scholar 

  25. Stump, A.: Subset types and partial functions. In: Baader, F. (ed.) CADE 2003. LNCS (LNAI), vol. 2741, pp. 151–165. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Farmer, W.M. (2004). Formalizing Undefinedness Arising in Calculus. In: Basin, D., Rusinowitch, M. (eds) Automated Reasoning. IJCAR 2004. Lecture Notes in Computer Science(), vol 3097. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-25984-8_35

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-25984-8_35

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-22345-0

  • Online ISBN: 978-3-540-25984-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics