Formalizing undefinedness arising in calculus

12Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

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.

Cite

CITATION STYLE

APA

Farmer, W. M. (2004). Formalizing undefinedness arising in calculus. In Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science) (Vol. 3097, pp. 475–489). Springer Verlag. https://doi.org/10.1007/978-3-540-25984-8_35

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free