Home
Scholarly Works
Formalizing Undefinedness Arising in Calculus
Conference

Formalizing Undefinedness Arising in Calculus

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.

Authors

Farmer WM

Series

Lecture Notes in Computer Science

Volume

3097

Pagination

pp. 475-489

Publisher

Springer Nature

Publication Date

January 1, 2004

DOI

10.1007/978-3-540-25984-8_35

Conference proceedings

Lecture Notes in Computer Science

ISSN

0302-9743

Labels

View published work (Non-McMaster Users)

Contact the Experts team